The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Integer Programming Algorithms: A Framework and State-of-the-Art Survey
Abstract
A unifying framework is developed to facilitate the understanding of most known computational approaches to integer programming. A number of currently operational algorithms are related to this framework, and prospects for future progress are assessed.
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
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Branch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
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
Optimization Theory of Large Systems
Lasdon, L. S., & Tabak, D. (1971) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1971.4308301 · Cited by 1,677
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
An Algorithm for the Traveling Salesman Problem
Little, J. D. C., Murty, K. G., Sweeney, D. W., & Karel, C. (1963) · Operations Research · doi:10.1287/opre.11.6.972 · Cited by 1,058
Multicommodity Distribution System Design by Benders Decomposition * † ‡
Geoffrion, A. M., & Graves§, G. W. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-6810-4_4 · Cited by 978
Self-citationA tree-search algorithm for mixed integer programming problems
Dakin, R. J. (1965) · The Computer Journal · doi:10.1093/comjnl/8.3.250 · Cited by 640
Boolean Methods in Operations Research and Related Areas
Hammer, P. L., & Rudeanu, S. (1968) · Ökonometrie und Unternehmensforschung / Econometrics and Operations Research · doi:10.1007/978-3-642-85823-9 · Cited by 529
Branch-and-Bound Methods: General Formulation and Properties
Mitten, L. G. (1970) · Operations Research · doi:10.1287/opre.18.1.24 · Cited by 336
Optimum Seeking with Branch and Bound
Agin, N. (1966) · Management Science · doi:10.1287/mnsc.13.4.b176 · Cited by 111
Integer Programming Methods for a Vessel Scheduling Problem
Appelgren, L. H. (1971) · Transportation Science · doi:10.1287/trsc.5.1.64 · Cited by 97
Shapiro, J. F. (1968) · Operations Research · doi:10.1287/opre.16.1.103 · Cited by 75
Cited by
Lagrangean relaxation for integer programming
Geoffrion, A. M. (1974) · Mathematical Programming Studies · doi:10.1007/bfb0120690 · Cited by 1,111
Self-citationMulticommodity Distribution System Design by Benders Decomposition * † ‡
Geoffrion, A. M., & Graves§, G. W. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-6810-4_4 · Cited by 978
Self-citationLagrangian Relaxation for Integer Programming
Geoffrion, A. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_9 · Cited by 974
Self-citationAdaGuiDE: An adaptive and guided differential evolution for continuous optimization problems
Li, Z., & Tam, V. (2024) · Applied Intelligence · doi:10.1007/s10489-024-05675-9 · Cited by 8
Metadata
- Authors
- Geoffrion, A. M., & Marsten, R. E.
- Venue
- Management Science
- Published
- 1972-05
- Volume
- 18
- Issue
- 9
- Pages
- 465-491
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2169666402
- Cited by
- 350
- References
- 13
- FWCI
- 17.76
- 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
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.