The DOI matches its Crossref record.
Combinatorial optimization
Abstract
There have been significant developments in the theory and practice of combinatorial optimization in the last 15 years. This progress has been evidenced by a continuously increasing number of internat
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
Cited by
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Boykov, Y., & Kolmogorov, V. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.60 · Cited by 4,577
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Combinatorial Auctions: A Survey
de Vries, S., & Vohra, R. V. (2003) · INFORMS Journal on Computing · doi:10.1287/ijoc.15.3.284.16077 · Cited by 985
Structural investigation of supply networks: A social network analysis approach
Kim, Y., Choi, T. Y., Yan, T., & Dooley, K. (2011) · Journal of Operations Management · doi:10.1016/j.jom.2010.11.001 · Cited by 771
A Parsimony Approach to Biological Pathway Reconstruction/Inference for Genomes and Metagenomes
Ye, Y., & Doak, T. G. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000465 · Cited by 686
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 1998-06-01
- Volume
- 35
- Issue
- 10
- Pages
- 35-5705-35-5705
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W2913132751
- Cited by
- 343
- References
- 0
- Type
- book review
- 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: Combinatorial optimization. https://app.cochat.ai/papers/10.5860/choice.35-5705
- The paper
- Combinatorial optimization. (1998). Choice Reviews Online. https://doi.org/10.5860/choice.35-5705
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.