Optimization Online


A novel branch-and-bound algorithm for quadratic mixed-integer problems with quadratic constraints

Simone Goettlich (goettlich***at***uni-mannheim.de)
Kathinka Hameister (hameister***at***math.uni-mannheim.de)
Michael Herty (herty***at***igpm.rwth-aachen.de)

Abstract: The efficient numerical treatment of convex quadratic mixed-integer optimization poses a challenging problem for present branch-and-bound algorithms. We introduce a method based on the duality principle for nonlinear convex problems to derive suitable bounds that can be directly exploited to improve heuristic branching rules. Numerical results indicate that the bounds allow the branch-and-bound tree to be searched and evaluated more efficiently compared to benchmark solvers. An extended computational study using different performance measures is presented for small, medium and large test instances.

Keywords: nonlinear mixed-integer programming, duality, branch-and-bound

Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation: University of Mannheim, Department of Mathematics, 68131 Mannheim, Germany Preprint Mai 2018

Download: [PDF]

Entry Submitted: 09/29/2017
Entry Accepted: 09/29/2017
Entry Last Modified: 05/25/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society