The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
Open accessOverview
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
Handbooks in operations research and management science
Nemhauser, G. L., & Kan, A. H. G. R. (1989) · Elsevier eBooks · Cited by 2,436
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (2011) · Cited by 2,083
Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004) · Networks · doi:10.1002/net.20033 · Cited by 693
Shortest Path Problems with Resource Constraints
Irnich, S., & Desaulniers, G. (2006) · Column Generation · doi:10.1007/0-387-25486-2_2 · Cited by 597
Fleet Management and Logistics
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5 · Cited by 485
Chapter 2 Time constrained routing and scheduling
Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80106-9 · Cited by 374
A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
Desrochers, M., & Soumis, F. (1988) · INFOR: Information Systems and Operational Research · doi:10.1080/03155986.1988.11732063 · Cited by 349
An algorithm for the resource constrained shortest path problem
Beasley, J. E., & Christofides, N. (1989) · Networks · doi:10.1002/net.3230190402 · Cited by 327
Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
Dror, M. (1994) · Operations Research · doi:10.1287/opre.42.5.977 · Cited by 325
A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
Desaulniers, G., Desrosiers, J., loachim, I., Solomon, M. M., Soumis, F., & Villeneuve, D. (1998) · Fleet Management and Logistics · doi:10.1007/978-1-4615-5755-5_3 · Cited by 238
Fleet Management and Logistics.
Ittmann, H. W., Crainic, T. G., & Gilbert Laporte, A. (1999) · Journal of the Operational Research Society · doi:10.2307/3010639 · Cited by 221
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
Boland, N., Dethridge, J., & Dumitrescu, I. (2006) · Operations Research Letters · doi:10.1016/j.orl.2004.11.011 · Cited by 200
Dumitrescu, I., & Boland, N. (2003) · Networks · doi:10.1002/net.10090 · Cited by 199
Resource Constrained Shortest Paths
Mehlhorn, K., & Ziegelmann, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45253-2_30 · Cited by 124
Plus court chemin avec contraintes d'horaires
Desrosiers, J., Pelletier, P., & Soumis, F. (1983) · RAIRO - Operations Research · doi:10.1051/ro/1983170403571 · Cited by 89
Cited by
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
Desaulniers, G., Errico, F., Irnich, S., & Schneider, M. (2016) · Operations Research · doi:10.1287/opre.2016.1535 · Cited by 497
Branch 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
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Jepsen, M., Petersen, B., Spoorendonk, S., & Pisinger, D. (2008) · Operations Research · doi:10.1287/opre.1070.0449 · Cited by 410
Metadata
- Authors
- Righini, G., & Salani, M.
- Venue
- Discrete Optimization
- Publisher
- Elsevier BV
- Published
- 2006-09
- Volume
- 3
- Issue
- 3
- Pages
- 255-273
- ISSN
- 1572-5286 (ISSN-L)
- OpenAlex
- W2099391941
- Cited by
- 364
- References
- 15
- FWCI
- 34.20
- Type
- journal article
- Language
- en
- Open access
- bronze
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.