The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
MIP: Theory and Practice — Closing the Gap
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
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
Georgia Institute of Technology
Tölle, W., Yasner, J., & Pieper, M. (1993) · Study and Research Guide in Computer Science · doi:10.1007/978-3-642-77393-8_12 · Cited by 260
The Design of the XMP Linear Programming Library
Marsten, R. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355972.355976 · Cited by 245
Presolving in linear programming
Andersen, E. D., & Andersen, K. D. (1995) · Mathematical Programming · doi:10.1007/bf01586000 · Cited by 228
Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
Gilbert, J. R., & Peierls, T. (1988) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0909058 · Cited by 227
Rothberg, E. E., & Gupta, A. (1991) · ACM Transactions on Mathematical Software · doi:10.1145/114697.116809 · Cited by 48
Self-citationSparse Matrix Ordering Methods for Interior Point Linear Programming
Rothberg, E. E., & Hendrickson, B. (1998) · INFORMS journal on computing · doi:10.1287/ijoc.10.1.107 · Cited by 23
Self-citation
Cited by
A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem
Carrion, M., & Arroyo, J. M. (2006) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2006.876672 · Cited by 1,731
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
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C. (2016) · Discrete Optimization · doi:10.1016/j.disopt.2016.01.005 · Cited by 563
Exploring relaxation induced neighborhoods to improve MIP solutions
Danna, E., Rothberg, E., & Pape, C. L. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0518-7 · Cited by 530
Self-citation
Metadata
- Authors
- Bixby, E. R., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R.
- Venue
- IFIP Advances in Information and Communication Technology
- Publisher
- Springer US
- Published
- 2000
- Pages
- 19-49
- ISSN
- 1868-422X (ISSN-L)
- 1868-4238
- OpenAlex
- W1594264634
- Cited by
- 258
- References
- 7
- FWCI
- 21.59
- Type
- conference paper
- 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: MIP: Theory and Practice — Closing the Gap. https://app.cochat.ai/papers/10.1007/978-0-387-35514-6_2
- The paper
- Bixby, E. R., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2000). MIP: Theory and Practice — Closing the Gap. IFIP Advances in Information and Communication Technology. https://doi.org/10.1007/978-0-387-35514-6_2
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.