The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
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
(1979) · Cited by 43,841
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
The vehicle routing problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90192-c · Cited by 1,749
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
A fast algorithm for the maximum clique problem
Östergård, P. R. J. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00290-6 · Cited by 590
Padberg, M. (1980) · Mathematical programming studies · doi:10.1007/bfb0120883 · Cited by 577
Shekhar, S., Xiong, H. Y., & Zhou, X. S. (2017) · Encyclopedia of GIS · doi:10.1007/978-3-319-17885-1_101452 · Cited by 568
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Fukasawa, R., Longo, H., Lysgaard, J., Aragão, M. P. D., Reis, M., Uchoa, E., & Werneck, R. F. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0644-x · Cited by 539
Solving Airline Crew Scheduling Problems by Branch-and-Cut
Hoffman, K. L., & Padberg, M. (1993) · Management Science · doi:10.1287/mnsc.39.6.657 · Cited by 537
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
Self-citationBalas, E., & Padberg, M. W. (1976) · SIAM Review · doi:10.1137/1018115 · Cited by 449
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
du Merle, O., Villeneuve, D. L., Desrosiers, J., & Hansen, P. (1999) · Discrete Mathematics · doi:10.1016/s0012-365x(98)00213-1 · Cited by 351
Optimal Routing under Capacity and Distance Restrictions
Laporte, G., Nobert, Y., & Desrochers, M. (1985) · Operations Research · doi:10.1287/opre.33.5.1050 · Cited by 307
Baldacci, R., Hadjiconstantinou, E., & Mingozzi, A. (2004) · Operations Research · doi:10.1287/opre.1040.0111 · Cited by 289
Self-citation3. 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
A Set Partitioning Approach to the Crew Scheduling Problem
Mingozzi, A., Boschetti, M. A., Ricciardelli, S., & Bianco, L. (1999) · Operations Research · doi:10.1287/opre.47.6.873 · Cited by 102
Self-citationBaldacci, R., Bodin, L. D., & Mingozzi, A. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2005.02.023 · Cited by 82
Self-citation
Cited by
Fifty Years of Vehicle Routing
Laporte, G. (2009) · Transportation Science · doi:10.1287/trsc.1090.0301 · Cited by 1,022
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
Self-citationBranch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Ropke, S., & Cordeau, J.-F. (2009) · Transportation Science · doi:10.1287/trsc.1090.0272 · Cited by 487
Baldacci, R., Mingozzi, A., & Roberti, R. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.07.037 · Cited by 474
Self-citationHeuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
Metadata
- Authors
- Baldacci, R., Christofides, N., & Mingozzi, A.
- Venue
- Mathematical Programming
- Published
- 2007-08-01
- Volume
- 115
- Issue
- 2
- Pages
- 351-385
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2082153300
- Cited by
- 364
- References
- 18
- FWCI
- 38.34
- 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.