The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Mixed Integer Linear Programming Formulation Techniques
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Combinatorial optimization. Polyhedra and efficiency.
Schrijver, A. (2003) · UvA-DARE (University of Amsterdam) · Cited by 4,637
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
(2003) · Selected Papers of Alan J Hoffman · doi:10.1142/9789812796936_others05 · Cited by 2,465
Ziegler, G. M. (1995) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-8431-1 · Cited by 2,329
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
An Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
Global Optimization: Deterministic Approaches
Horst, R., & Hoang, T. (1992) · Cited by 1,635
SCIP: solving constraint integer programs
Achterberg, T. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-008-0001-1 · Cited by 1,167
Production Planning by Mixed Integer Programming
(2006) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/0-387-33477-7 · Cited by 959
Discrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
Wiley encyclopedia of operations research and management science
(2011) · Choice Reviews Online · doi:10.5860/choice.49-0052 · Cited by 781
Handbook of geometry of Banach spaces
Johnson, W. B., & Lindenstrauss, J. (2001) · Cited by 650
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91233-6 · Cited by 591
Jointly Constrained Biconvex Programming
Al-Khayyal, F. A., & Falk, J. E. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.2.273 · Cited by 553
Non-convex mixed-integer nonlinear programming: A survey
Burer, S., & Letchford, A. N. (2012) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2012.08.001 · Cited by 547
Conforti, M., Cornuéjols, G., & Zambelli, G. (2014) · Graduate Texts in Mathematics · doi:10.1007/978-3-319-11008-0 · Cited by 546
An Elementary Introduction to Modern Convex Geometry
Ball, K. (1997) · Cambridge University Press eBooks · doi:10.1017/9781009701853.002 · Cited by 483
Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Glover, F., & Woolsey, E. (1974) · Operations Research · doi:10.1287/opre.22.1.180 · Cited by 404
Vielma, J. P., Ahmed, S., & Nemhauser, G. L. (2009) · Operations Research · doi:10.1287/opre.1090.0721 · Cited by 371
Self-citationThe boolean quadric polytope: Some characteristics, facets and relatives
Padberg, M. W. (1989) · Mathematical Programming · doi:10.1007/bf01589101 · Cited by 356
Nonlinear Programming: Theory, Algorithms and Applications
McCormick, G. P. (1968) · Medical Entomology and Zoology · Cited by 304
Logic-based methods for optimization: combining optimization and constraint satisfaction
(2001) · Choice Reviews Online · doi:10.5860/choice.38-3939 · Cited by 304
MIP: Theory and Practice — Closing the Gap
Bixby, E. R., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2000) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35514-6_2 · Cited by 258
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
Adams, W. P., & Sherali, H. D. (1986) · Management Science · doi:10.1287/mnsc.32.10.1274 · Cited by 255
Methods of Nonlinear 0-1 Programming
Hansen, P. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70343-1 · Cited by 220
Watters, L. J. (1967) · Operations Research · doi:10.1287/opre.15.6.1171 · Cited by 220
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
Johnson, E. L., Nemhauser, G. L., & Savelsbergh, M. W. P. (2000) · INFORMS Journal on Computing · doi:10.1287/ijoc.12.1.2.11900 · Cited by 206
Bixby, R., & Rothberg, E. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0091-y · Cited by 193
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & de Wolf, R. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2213988 · Cited by 189
On the existence of optimal solutions to integer and mixed-integer programming problems
Meyer, R. R. (1974) · Mathematical Programming · doi:10.1007/bf01585518 · Cited by 171
Mixed Integer Programming Computation
Lodi, A. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_16 · Cited by 163
Reformulation and Decomposition of Integer Programs
Vanderbeck, F., & Wolsey, L. A. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_13 · Cited by 159
Mixed logical-linear programming
Hooker, J., & Osorio, M. A. (1999) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(99)00100-6 · Cited by 159
The matching polytope has exponential extension complexity
Rothvoß, T. (2014) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2591796.2591834 · Cited by 146
Wiley Series in Discrete Mathematics and Optimization
Du, D., & Ko, K. (2014) · doi:10.1002/9781118595091.scard · Cited by 143
Misener, R., Thompson, J. P., & Floudas, C. A. (2011) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2011.01.026 · Cited by 128
Solving Connected Subgraph Problems in Wildlife Conservation
Dilkina, B., & Gomes, C. P. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13520-0_14 · Cited by 122
18. Mixed-Integer Programming: A Progress Report
Bixby, R. E., Fenelon, M., Gu, Z., Rothberg, E. E., & Wunderling, R. (2004) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718805.ch18 · Cited by 115
Misener, R., & Floudas, C. A. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0555-6 · Cited by 104
Piecewise-Linear Approximations of Multidimensional Functions
Misener, R., & Floudas, C. A. (2009) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-009-9626-0 · Cited by 99
A cutting plane method for solving linear generalized disjunctive programming problems
Sawaya, N. W., & Grossmann, I. E. (2005) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2005.04.004 · Cited by 78
Misener, R., & Floudas, C. A. (2010) · Industrial & Engineering Chemistry Research · doi:10.1021/ie100025e · Cited by 75
Reformulations in Mathematical Programming: Definitions and Systematics
Liberti, L. (2009) · RAIRO - Operations Research · doi:10.1051/ro/2009005 · Cited by 71
Misener, R., Gounaris, C. E., & Floudas, C. A. (2010) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2010.02.014 · Cited by 54
Stralberg, D., Applegate, D., Phillips, S. J., Herzog, M. P., Nur, N., & Warnock, N. D. (2008) · Biological Conservation · doi:10.1016/j.biocon.2008.10.013 · Cited by 39
Improved compact linearizations for the unconstrained quadratic 0–1 minimization problem
Hansen, P., & Meyer, C. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.008 · Cited by 35
A linearization framework for unconstrained quadratic (0-1) problems
Guèye, S., & Michelon, P. Y. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2008.01.028 · Cited by 34
Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
Adams, W. P., & Henry, S. (2012) · Operations Research · doi:10.1287/opre.1120.1106 · Cited by 31
Fifty-Plus Years of Combinatorial Integer Programming
Cook, W. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_12 · Cited by 30
Discontinuous piecewise linear optimization
Conn, A. R., & Mongeau, M. (1998) · Mathematical Programming · doi:10.1007/bf01581171 · Cited by 29
Convexity, complexity, and high dimensions
Szarek, S. J. (2007) · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · doi:10.4171/022-2/76 · Cited by 25
Cited by
Optimal Traffic-Power Flow in Urban Electrified Transportation Networks
Wei, W., Mei, S., Wu, L., Shahidehpour, M., & Fang, Y. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2612239 · Cited by 285
Eren, Y., Küçükdemiral, İ. B., & Üstoğlu, İ. (2017) · Optimization in Renewable Energy Systems · doi:10.1016/b978-0-08-101041-9.00002-8 · Cited by 67
Metadata
- Authors
- Vielma, J. P.
- Venue
- SIAM Review
- Published
- 2015-01
- Volume
- 57
- Issue
- 1
- Pages
- 3-57
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W1563391815
- Cited by
- 358
- References
- 55
- FWCI
- 25.39
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.