Global equilibrium search applied to the unconstrained binary quadratic optimization problem
From MaRDI portal
Publication:5459821
DOI10.1080/10556780701550083zbMath1145.90430OpenAlexW2090382945MaRDI QIDQ5459821
Oleg A. Prokopyev, Oleg V. Shylo, Vladimir P. Shylo, Panos M. Pardalos
Publication date: 29 April 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701550083
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
On characterization of maximal independent sets via quadratic optimization ⋮ A review of recent advances in global optimization ⋮ Periodic complementary binary sequences and combinatorial optimization algorithms ⋮ A column generation approach for the unconstrained binary quadratic programming problem ⋮ Solving unconstrained binary quadratic programming problem by global equilibrium search ⋮ Solving the maxcut problem by the global equilibrium search ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems ⋮ Solving weighted MAX-SAT via global equilibrium search
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- A solvable case of quadratic 0-1 programming
- Complexity of uniqueness and local search in quadratic 0-1 programming
- The maximum clique problem
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
- Minimization of a quadratic pseudo-Boolean function
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Bounding the probability of success of stochastic methods for global optimization
- An evolutionary heuristic for quadratic 0-1 programming
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- Problems of discrete optimization: challenges and main approaches to solve them
- Lower bound improvement and forcing rule for quadratic binary programming
- Graph separation techniques for quadratic zero-one programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Maximizing the Product of Two Linear Functions In 0-1 Variables
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Minimum cuts and related problems
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Construction of test problems in quadratic bivalent programming
- Semidefinite relaxation and nonconvex quadratic optimization
- A branch and bound algorithm for the maximum clique problem
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
This page was built for publication: Global equilibrium search applied to the unconstrained binary quadratic optimization problem
