A new branch and bound method with pretreatment for the binary quadratic programming

DOI10.1016/j.amc.2007.03.006zbMath1193.90165OpenAlexW2086657366MaRDI QIDQ990519

Xuewen Mu, Yaling Zhang, San-Yang Liu

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.03.006

zbMATH Keywords

branch and bound methodbinary quadratic programminginitial solutionpretreatment methodpruning regulation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Boolean programming (90C09)

Related Items (1)

Erratum to ``A new branch and bound method with pretreatment for the binary quadratic programming

Cites Work

• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Introduction to global optimization.

This page was built for publication: A new branch and bound method with pretreatment for the binary quadratic programming