Global equilibrium search applied to the unconstrained binary quadratic optimization problem

Authors:
Panos M. Pardalos;Oleg A. Prokopyev;Oleg V. Shylo;Vladimir P. Shylo
Affiliations:
Department of ISE, University of Florida, Gainesville, FL, USA;Department of IE, University of Pittsburgh, Pittsburgh, PA, USA;Department of ISE, University of Florida, Gainesville, FL, USA;Institute of Cybernetics, NAS of Ukraine, Kiev, Ukraine
Venue:
Optimization Methods & Software
Year:
2008

Citing 15
Cited 8

A solvable case of quadratic 0-1 programming

Discrete Applied Mathematics
An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
Construction of test problems in quadratic bivalent programming

ACM Transactions on Mathematical Software (TOMS)
A branch and bound algorithm for the maximum clique problem

Computers and Operations Research
Tabu search

Modern heuristic techniques for combinatorial problems
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits

Mathematical Programming: Series A and B
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Adaptive Memory Tabu Search for Binary Quadratic Programs

Management Science
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

Mathematical Programming: Series A and B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming

Computational Optimization and Applications
Problems of discrete optimization: Challenges and main approaches to solve them

Cybernetics and Systems Analysis

A review of recent advances in global optimization

Journal of Global Optimization
Global optimality conditions for quadratic 0-1 optimization problems

Journal of Global Optimization
Solving the maxcut problem by the global equilibrium search

Cybernetics and Systems Analysis
Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems

Expert Systems with Applications: An International Journal
Solving weighted MAX-SAT via global equilibrium search

Operations Research Letters
Global equilibrium search algorithms for combinatorial optimization problems

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search

International Journal of Swarm Intelligence Research
On characterization of maximal independent sets via quadratic optimization

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a heuristic method for solving the unconstrained binary quadratic optimization problem based on a global equilibrium search framework. We investigate performance of the proposed approach and compare it with the best available solver [G. Palubeckis, Multistart tabu search strategies for the unconstrained binary quadratic optimization problem, Ann. Oper. Res., 131 (2004), pp. 259-282; G. Palubeckis, Unconstrained binary quadratic optimization. Available at http://www.soften.ktu.lt/∼gintaras/binqopt.html (Last accessed December 2006).] on well-known benchmarks instances. The reported computational results indicate a high efficiency of the heuristic.