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

DOI10.1016/J.AMC.2007.03.006MaRDI QIDQ990519zbMATH OpenOpenAlexFDO

Authors Xuewen Mu, Ya-Ling Zhang, Sanyang 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

binary quadratic programmingbranch and bound methodinitial solutionpretreatment methodpruning regulation

Mathematics Subject Classification ID

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

Recommendations

• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Lower bound improvement and forcing rule for quadratic binary programming
• A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
• A new algorithm for the general quadratic programming problems with box constraints
• Bivalent quadratic programming problem - A computational study

Cites work

• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• Global optimality conditions for quadratic optimization problems with binary constraints
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Introduction to global optimization.

Cited in

(1)

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

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

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