Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search

A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem. It is compared with the best methods of solving this problem. The GES algorithm is shown to be better both in speed and solution quality.

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis Vol. 47; no. 6; pp. 889 - 897
Main Authors: Shylo, V. P., Shylo, O. V.
Format: Journal Article
Language:English
Published: Boston Springer US 01.11.2011
Springer Nature B.V
Subjects:
Algorithms
Artificial Intelligence
Binary systems
Boolean
Control
Cybernetics
Equilibrium
Mathematics
Mathematics and Statistics
Optimization
Processor Architectures
Quadratic programming
Searching
Software Engineering/Programming and Operating Systems
Studies
Systems analysis
Systems Theory
binary quadratic programming
global equilibrium search
approximate methods
computational experiment
comparative analysis of algorithms
ISSN:1060-0396, 1573-8337
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem. It is compared with the best methods of solving this problem. The GES algorithm is shown to be better both in speed and solution quality.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-011-9368-5