A new branch and bound method for integer quadratic programming problems

DOI10.3969/J.ISSN.1673-3193.2015.04.004MaRDI QIDQ3461341zbMATH OpenFDO

Authors Xia Liu, Yuelin Gao

Publication date 15 January 2016

Full work available at URL https://doi.org/10.3969/J.ISSN.1673-3193.2015.04.004

zbMATH Keywords

branch-and-boundinteger quadratic programminglinear relaxationrectangular reduction

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A new branch and bound algorithm for integer quadratic programming problems
• A new branch-and-bound algorithm for solving large-scale complex integer convex quadratic programming problems
• A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
• A new branch and bound algorithm for indefinite integer quadratic programs

Cited in

(13)

• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• A new bounding technique in branch-and-bound algorithms for mixed integer programming
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
• A new algorithm for quadratic integer programming problems with cardinality constraint
• A new variable reduction technique for convex integer quadratic programs
• Quaternary hyperplane branching with internally generated cutting planes for solving integer programmes
• Branch and cut method for solving integer indefinite quadratic bilevel programs
• A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems
• A new branch and bound algorithm for integer quadratic programming problems
• scientific article; zbMATH DE number 7366738 (Why is no real title available?)
• Dual approaches for a specific class of integer nonlinear programming problems
• A new branch-and-bound algorithm for solving large-scale complex integer convex quadratic programming problems
• New bounds on the unconstrained quadratic integer programming problem

This page was built for publication: A new branch and bound method for integer quadratic programming problems

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