Solving unconstrained binary quadratic programming problem by global equilibrium search

DOI10.1007/s10559-011-9368-5zbMath1298.90065OpenAlexW2021542890MaRDI QIDQ464982

J. Herrera, D. Rodríguez-Gómez

Publication date: 30 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-011-9368-5

zbMATH Keywords

computational experimentbinary quadratic programmingapproximate methodscomparative analysis of algorithmsglobal equilibrium search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

Metaheuristic Algorithms, Building an iterative heuristic solver for a quantum annealer, Algorithm unions for solving discrete optimization problems, The unconstrained binary quadratic programming problem: a survey, Kernel technology to solve discrete optimization problems, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem

Cites Work

• Unnamed Item
• A hybrid metaheuristic approach to solving the UBQP problem
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function
• The maximum clique problem
• A heuristic method for the quadratic assignment problem
• An evolutionary heuristic for quadratic 0-1 programming
• A unified modeling and solution framework for combinatorial optimization problems
• A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
• The method of global equilibrium search
• Adaptive Memory Tabu Search for Binary Quadratic Programs
• Quadratic knapsack problems
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• A polynomial case of unconstrained zero-one quadratic optimization