The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Shortest Path Problems with Resource Constraints
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
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Efficient string matching: an aid to bibliographic search
Aho, A. V., & Corasick, M. J. (1975) · Communications of the ACM · doi:10.1145/360825.360855 · Cited by 2,944
Handbooks in operations research and management science
Nemhauser, G. L., & Kan, A. H. G. R. (1989) · Elsevier eBooks · Cited by 2,436
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
Time Constrained Routing and Scheduling
Desrosiers, J., Solomon, M. M., Soumis, F., & Dumas, Y. (1992) · PolyPublie (École Polytechnique de Montréal) · doi:10.1016/s0927-0507%2805%2980106-9 · Cited by 709
Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004) · Networks · doi:10.1002/net.20033 · Cited by 693
Multidimensional divide-and-conquer
Bentley, J. L. (1980) · Communications of the ACM · doi:10.1145/358841.358850 · Cited by 672
The pickup and delivery problem with time windows
Dumas, Y., Desrosiers, J., & Soumis, F. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90319-q · Cited by 667
Fleet Management and Logistics
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5 · Cited by 485
Routing with time windows by column generation
Desrosiers, J., Soumis, F., & Desrochers, M. (1984) · Networks · doi:10.1002/net.3230140406 · Cited by 366
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
Drive: Dynamic Routing of Independent Vehicles
Savelsbergh, M., & Sol, M. (1998) · Operations Research · doi:10.1287/opre.46.4.474 · Cited by 334
A Column Generation Approach to the Urban Transit Crew Scheduling Problem
Desrochers, M., & Soumis, F. (1989) · Transportation Science · doi:10.1287/trsc.23.1.1 · Cited by 332
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
Vehicle Routing with Time Windows
Kolen, A. W. J., Kan, A. H. G. R., & Trienekens, H. W. J. M. (1987) · Operations Research · doi:10.1287/opre.35.2.266 · Cited by 304
A Column Generation Approach for Large-Scale Aircrew Rostering Problems
Gamache, M., Soumis, F., Marquis, G., & Desrosiers, J. (1999) · Operations Research · doi:10.1287/opre.47.2.247 · Cited by 239
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
Self-citationVehicle Routing Problem with elementary shortest path based column generation
Chabrier, A. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2005.02.029 · Cited by 232
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
Self-citationDesaulniers, G., Desrosiers, J., Dumas, Y., Marc, S., Rioux, B., Solomon, M. M., & Soumis, F. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(96)00195-6 · Cited by 187
Self-citationComputer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling
Feder, P. I. (1982) · Technometrics · doi:10.1080/00401706.1982.10487724 · Cited by 186
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
Vance, P. H., Barnhart, C., Johnson, E. L., & Nemhauser, G. L. (1997) · Operations Research · doi:10.1287/opre.45.2.188 · Cited by 183
Ioachim, I., G�linas, S., Soumis, F., & Desrosiers, J. (1998) · Networks · doi:10.1002/(sici)1097-0037(199805)31:3<193::aid-net6>3.0.co;2-a · Cited by 181
The shortest path problem with forbidden paths
Villeneuve, D. L., & Desaulniers, G. (2004) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.01.032 · Cited by 100
Self-citationPlus court chemin avec contraintes d'horaires
Desrosiers, J., Pelletier, P., & Soumis, F. (1983) · RAIRO - Operations Research · doi:10.1051/ro/1983170403571 · Cited by 90
The Preferential Bidding System at Air Canada
Gamache, M., Soumis, F., Villeneuve, D. L., Desrosiers, J., & Gélinas, É. (1998) · Transportation Science · doi:10.1287/trsc.32.3.246 · Cited by 85
Methods for routing with time windows
Desrosiers, J., Soumis, F., Desrochers, M., & SauvéGerad, M. (1986) · European Journal of Operational Research · doi:10.1016/0377-2217(86)90243-2 · Cited by 46
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
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
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
Righini, G., & Salani, M. (2006) · Discrete Optimization · doi:10.1016/j.disopt.2006.05.007 · Cited by 364
Metadata
- Authors
- Irnich, S., & Desaulniers, G.
- Venue
- Column Generation
- Publisher
- Springer-Verlag
- Published
- 2006-03-10
- Pages
- 33-65
- OpenAlex
- W311217234
- Cited by
- 597
- References
- 32
- FWCI
- 78.15
- Type
- book chapter
- 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.