The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
Abstract
This paper is about modeling and solving mixed integer programming (MIP) problems. In the last decade, the use of mixed integer programming models has increased dramatically. Fifteen years ago, mainframe computers were required to solve problems with a hundred integer variables. Now it is possible to solve problems with thousands of integer variables on a personal computer and obtain provably good approximate solutions to problems such as set partitioning with millions of binary variables. These advances have been made possible by developments in modeling, algorithms, software, and hardware. This paper focuses on effective modeling, preprocessing, and the methodologies of branch-and-cut and branch-and-price, which are the techniques that make it possible to treat problems with either a very large number of constraints or a very large number of variables. We show how these techniques are useful in important application areas such as network design and crew scheduling. Finally, we discuss the relatively new research areas of parallel integer programming and stochastic integer programming.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Self-citation
Cited by
State-of-the-art review of optimization methods for short-term scheduling of batch processes
Méndez, C. A., Cerdá, J., Grossmann, I. E., Harjunkoski, I., & Fahl, M. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.02.008 · Cited by 809
Biegler, L. T., & Grossmann, I. E. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.11.003 · Cited by 593
Chance-Constrained Optimal Path Planning With Obstacles
Blackmore, L., Ono, M., & Williams, B. C. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2161160 · Cited by 427
Tight and compact MILP formulation for the thermal unit commitment problem
Morales-Espana, Latorre, J. M., & Ramos, A. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2251373 · Cited by 419
Mixed Integer Linear Programming Formulation Techniques
Vielma, J. P. (2015) · SIAM Review · doi:10.1137/130915303 · Cited by 358
Metadata
- Authors
- Johnson, E. L., Nemhauser, G. L., & Savelsbergh, M. W. P.
- Venue
- INFORMS Journal on Computing
- Published
- 2000-02
- Volume
- 12
- Issue
- 1
- Pages
- 2-23
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2105887395
- Cited by
- 206
- References
- 1
- FWCI
- 13.77
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. https://app.cochat.ai/papers/10.1287/ijoc.12.1.2.11900
- The paper
- Johnson, E. L., Nemhauser, G. L., & Savelsbergh, M. W. P. (2000). Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.12.1.2.11900
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.