Conference proceeding
THE MILP ROAD TO MIQCP
Mixed Integer Nonlinear Programming, pp.373-405
IMA Volumes in Mathematics and its Applications
01/01/2012
DOI: 10.1007/978-1-4614-1927-3_13
Abstract
This paper surveys results on the NP-hard mixed-integer quadratically constrained programming problem. The focus is strong convex relaxations and valid inequalities, which can become the basis of efficient global techniques. In particular, we discuss relaxations and inequalities arising from the algebraic description of the problem as well as from dynamic procedures based on disjunctive programming. These methods can be viewed as generalizations of techiniques for mixed-integer linear programming. We also present brief computational results to indicate the strength and computational requirements of these methods.
Details
- Title: Subtitle
- THE MILP ROAD TO MIQCP
- Creators
- Samuel Burer - University of IowaAnureet Saxena - Axioma
- Contributors
- J Lee (Editor)S Leyffer (Editor)
- Resource Type
- Conference proceeding
- Publication Details
- Mixed Integer Nonlinear Programming, pp.373-405
- Publisher
- Springer Nature; NEW YORK
- Series
- IMA Volumes in Mathematics and its Applications
- DOI
- 10.1007/978-1-4614-1927-3_13
- eISSN
- 2198-3224
- ISSN
- 0940-6573
- Number of pages
- 33
- Language
- English
- Date published
- 01/01/2012
- Academic Unit
- Business Analytics
- Record Identifier
- 9984380614902771
Metrics
3 Record Views