Solving unconstrained binary quadratic programming problem by global equilibrium search

DOI10.1007/S10559-011-9368-5zbMATH Open1298.90065OpenAlexW2021542890MaRDI QIDQ464982FDOQ464982

V. P. Shylo, O. V. Shylo

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

Recommendations

• Global equilibrium search applied to the unconstrained binary quadratic optimization problem
• The unconstrained binary quadratic programming problem: a survey
• The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems
• Greedy and local search heuristics for unconstrained binary quadratic programming
• A hybrid metaheuristic approach to solving the UBQP problem

zbMATH Keywords

binary quadratic programmingcomputational experimentapproximate methodscomparative analysis of algorithmsglobal equilibrium search

Mathematics Subject Classification ID

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

Cites Work

• The maximum clique problem
• A unified modeling and solution framework for combinatorial optimization problems
• Quadratic knapsack problems
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• Adaptive memory tabu search for binary quadratic programs
• A hybrid metaheuristic approach to solving the UBQP problem
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• An evolutionary heuristic for quadratic 0-1 programming
• Iterated tabu search for 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
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function
• A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem
• A heuristic method for the quadratic assignment problem
• The method of global equilibrium search

Cited In (9)

• Metaheuristic Algorithms
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
• The unconstrained binary quadratic programming problem: a survey
• Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem
• The method of global equilibrium search
• Building an iterative heuristic solver for a quantum annealer
• Kernel technology to solve discrete optimization problems
• Algorithm unions for solving discrete optimization problems

This page was built for publication: Solving unconstrained binary quadratic programming problem by global equilibrium search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464982)