The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
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
Dantzig, G. B., & Ramser, J. H. (1959) · Management Science · doi:10.1287/mnsc.6.1.80 · Cited by 4,985
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
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
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Desrochers, M., Desrosiers, J., & Solomon, M. (1992) · Operations Research · doi:10.1287/opre.40.2.342 · Cited by 1,197
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Kohl, N., Desrosiers, J., Madsen, O. B. G., Solomon, M. M., & Soumis, F. (1999) · Transportation Science · doi:10.1287/trsc.33.1.101 · Cited by 411
On an Integer Program for a Delivery Problem
Balinski, M., & Quandt, R. E. (1964) · Operations Research · doi:10.1287/opre.12.2.300 · Cited by 373
State‐space relaxation procedures for the computation of bounds to routing problems
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Networks · doi:10.1002/net.3230110207 · Cited by 330
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
Barnhart, C., Hane, C. A., & Vance, P. H. (2000) · Operations Research · doi:10.1287/opre.48.2.318.12378 · Cited by 325
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Desrosiers, J., Solomon, M. M., Soumis, F., Kohl, N., & Madsen, O. B. G. (1997) · Les Cahiers du GERAD · Cited by 225
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
Irnich, S., & Villeneuve, D. (2006) · INFORMS Journal on Computing · doi:10.1287/ijoc.1040.0117 · Cited by 215
3. Branch-And-Cut Algorithms for the Capacitated VRP
Naddef, D., & Rinaldi, G. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515.ch3 · Cited by 201
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
van den Akker, M., Hurkens, C. A. J., & Savelsbergh, M. W. P. (2000) · INFORMS journal on computing · doi:10.1287/ijoc.12.2.111.11896 · Cited by 200
Multimodal Express Package Delivery: A Service Network Design Application
Kim, D., Barnhart, C., Ware, K. A., & Reinhardt, G. (1999) · Transportation Science · doi:10.1287/trsc.33.4.391 · Cited by 149
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108 · cited 1×
“[11] and Wilhelm[39] comment on this matter).”
Lot-Sizing with Start-Up Times
Vanderbeck, F. (1998) · Management Science · doi:10.1287/mnsc.44.10.1409 · Cited by 59
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Fukasawa, R., Lysgaard, J., de Aragão, M. P., Reis, M., Uchoa, E., & Werneck, R. F. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25960-2_1 · Cited by 50
Self-citation
Cited by
A general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
Fifty Years of Vehicle Routing
Laporte, G. (2009) · Transportation Science · doi:10.1287/trsc.1090.0301 · Cited by 1,022
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
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Baldacci, R., Mingozzi, A., & Roberti, R. (2011) · Operations Research · doi:10.1287/opre.1110.0975 · Cited by 506
Combinatorial optimization and Green Logistics
Sbihi, A., & Eglese, R. W. (2007) · 4OR · doi:10.1007/s10288-007-0047-3 · Cited by 498
Metadata
- Authors
- Fukasawa, R., Longo, H., Lysgaard, J., Aragão, M. P. D., Reis, M., Uchoa, E., & Werneck, R. F.
- Venue
- Mathematical Programming
- Published
- 2005-10-12
- Volume
- 106
- Issue
- 3
- Pages
- 491-511
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2096796578
- Cited by
- 539
- References
- 17
- FWCI
- 67.82
- 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.