A provable better Branch and Bound method for a nonconvex integer quadratic programming problem

DOI10.1016/j.jcss.2004.07.002zbMath1079.90167OpenAlexW2035506911MaRDI QIDQ1765223

Wen-Xing Zhu

Publication date: 23 February 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.07.002

zbMATH Keywords

branch and boundComplete enumerationNonconvex integer quadratic programming

Mathematics Subject Classification ID

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

Related Items

Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ An improved Bernstein global optimization algorithm for MINLP problems with application in process industry ⋮ Global optimization algorithm for mixed integer quadratically constrained quadratic program ⋮ Partner selection with a due date constraint in virtual enterprises ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on adapting methods for continuous global optimization to the discrete case
• An algorithm for indefinite integer quadratic programming
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms