MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Mixed Integer Linear Programming Formulation Techniques

Author(s)
Vielma, Juan Pablo
Thumbnail
DownloadVielma-2015-Mixed Integer Linear.pdf (1.408Mb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
A wide range of problems can be modeled as Mixed Integer Linear Programming (MIP) problems using standard formulation techniques. However, in some cases the resulting MIP can be either too weak or too large to be effectively solved by state of the art solvers. In this survey we review advanced MIP formulation techniques that result in stronger and/or smaller formulations for a wide class of problems.
Date issued
2015-02
URI
http://hdl.handle.net/1721.1/96480
Department
Sloan School of Management
Journal
SIAM Review
Publisher
Society for Industrial and Applied Mathematics
Citation
Vielma, Juan Pablo. “Mixed Integer Linear Programming Formulation Techniques.” SIAM Review 57, no. 1 (January 2015): 3–57. © 2015 Society for Industrial and Applied Mathematics
Version: Final published version
ISSN
0036-1445
1095-7200

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.