Mixed Integer Programming
(2008) Wiley Encyclopedia of Computer Science and Engineering — ISBN: [9780470050118], 1883-1892, published
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- A linear mixed integer program is an optimization problem in which a nonempty subset of integer variables (unknowns) and a subset of real-valued (continuous) variables exist, the constraints are all linear equations or inequalities, and the objective is a linear function to be minimized (or maximized). After presenting several practical applications of mixed integer programming, we describe the main classes of algorithms, branch-and-bound and branch-and-cut, that are used to solve this hard class of problems. Considerable attention is paid to ways to improve solution times, involving preprocessing, reformulation with cuts and/or new variables, and heuristics.
- Affiliations
Louvain School of Management Operations and Information
Citations
Wolsey, L. (2008). Mixed Integer Programming. In Wiley Encyclopedia of Computer Science and Engineering (pp. 1883-1892). Wiley-Interscience. https://doi.org/10.1002/9780470050118.ecse244