Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
Open accessThe 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
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.
Cites
Benchmarking optimization software with performance profiles
Dolan, E. D., & Morè, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,469 · see citing works
Bolaño, L. J. C., Uribe-Martes, C., Coronado-Hernández, J. R., Ramirez-Ríos, D. G., Herazo-Padilla, N., Paez-Logreira, H., & Gatica, G. (2014) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973594 · Cited by 1,141 · see citing works
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 669 · see citing works
A survey on pickup and delivery problems
Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008) · Journal für Betriebswirtschaft · doi:10.1007/s11301-008-0036-4 · Cited by 611 · see citing works
Shortest Path Problems with Resource Constraints
Irnich, S., & Desaulniers, G. (2006) · Springer eBooks · doi:10.1007/0-387-25486-2_2 · Cited by 596 · see citing works
Self-citationBranch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Røpke, S., & Cordeau, J. (2009) · Transportation Science · doi:10.1287/trsc.1090.0272 · Cited by 483 · see citing works
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Jepsen, M. K., Petersen, B., Spoorendonk, S., et al. (2007) · Operations Research · doi:10.1287/opre.1070.0449 · Cited by 416 · see citing works
Righini, G., & Salani, M. (2006) · Discrete Optimization · doi:10.1016/j.disopt.2006.05.007 · Cited by 362 · see citing works
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Kohl, N., Desrosiers, J., Madsen, O. B. G., et al. (1999) · Transportation Science · doi:10.1287/trsc.33.1.101 · Cited by 344 · see citing works
Improved branch-cut-and-price for capacitated vehicle routing
Pecin, D., Pessoa, A. A., Poggi, M., & Uchoa, E. (2016) · Mathematical Programming Computation · doi:10.1007/s12532-016-0108-8 · Cited by 244 · see citing works
A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
Desaulniers, G., Desrosiers, J., loachim, I., et al. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5_3 · Cited by 238 · see citing works
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Baldacci, R., Bartolini, E., & Mingozzi, A. (2011) · Operations Research · doi:10.1287/opre.1100.0881 · Cited by 227 · see citing works
A Metaheuristic for the Pickup and Delivery Problem with Time Windows
Li, H., & Lim, A. E. B. (2003) · International Journal of Artificial Intelligence Tools · doi:10.1142/s0218213003001186 · Cited by 222 · see citing works
Fleet Management and Logistics.
Ittmann, H. W., Crainic, T. G., & Laporte, G. (1999) · Journal of the Operational Research Society · doi:10.2307/3010639 · Cited by 219 · see citing works
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Desrosiers, J., Solomon, M. M., Soumis, F., et al. (1997) · Les Cahiers du GERAD · Cited by 215 · see citing works
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 151 · see citing works
Resource extension functions: properties, inversion, and generalization to segments
Irnich, S. (2007) · OR Spectrum · doi:10.1007/s00291-007-0083-6 · Cited by 129 · see citing works
Self-citationNew State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
Baldacci, R., Mingozzi, A., & Roberti, R. (2011) · INFORMS journal on computing · doi:10.1287/ijoc.1110.0456 · Cited by 82 · see citing works
Tilk, C., Rothenbächer, A.-K., Gschwind, T., et al. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.03.017 · Cited by 79 · see citing works
Self-citationCherkesly, M., Desaulniers, G., & Laporte, G. (2014) · Transportation Science · doi:10.1287/trsc.2014.0535 · Cited by 58 · see citing works
Cherkesly, M., Desaulniers, G., Irnich, S., et al. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.10.046 · Cited by 53 · see citing works
Self-citationPickup and Delivery Problems for Goods Transportation
Iori, M. (2014) · IRIS UNIMORE (University of Modena and Reggio Emilia) · Cited by 45 · see citing works
The pickup and delivery problem with time windows and handling operations
Veenstra, M., Cherkesly, M., Desaulniers, G., et al. (2016) · Computers & Operations Research · doi:10.1016/j.cor.2016.07.014 · Cited by 43 · see citing works
Selective pricing in branch-price-and-cut algorithms for vehicle routing
Desaulniers, G., Pecin, D., & Contardo, C. (2016) · PolyPublie (École Polytechnique de Montréal) · Cited by 1 · see citing works
Flagged first, then by citations
Research works printed but not linked: 2
- [6]6. Desaulniers, G., Desrosiers, J., and Solomon, M., editors (2005). Column Generation. Springer, New York, NY.
- [8]8. Doerner, K. F. and Salazar-González, J.-J. (2014). Pickup-and-delivery problems for people transportation. In Toth and Vigo (2014), chapter 7, pages 193-212.
Cited by
Sorted by citations
Robust earth observation satellite scheduling with uncertainty of cloud coverage
Wang, X., Song, G., Leus, R., & Han, C. (2020) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2019.2947978 · Cited by 70 · see citing works
Scheduling multiple agile Earth observation satellites with multiple observations
Wang, X., Han, C., & Leus, R. (2026) · Advances in Space Research · doi:10.1016/j.asr.2025.10.042 · Cited by 24 · see citing works
- Authors
- Gschwind, T., Irnich, S., Rothenbächer, A.-K., & Tilk, C.
- Affiliations
- Johannes Gutenberg University Mainz (DE)
- Corresponding author
- Gschwind, Timo
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2018-04
- Volume
- 266
- Issue
- 2
- Pages
- 521-530
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2732379263
- Semantic Scholar
- 6f71da9c68a63a79be8de9fa76643ec576abe5b6
- Cited by
- 48
- References
- 24
- Citations by year
- 2026: 5 · 2025: 4 · 2024: 8 · 2023: 5 · 2022: 5 · 2021: 5 · 2020: 5 · 2019: 10 · 2018: 1
- FWCI
- 4.80
- Type
- journal article
- Language
- en
- Open access
- Locations
- European Journal of Operational Research (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Physical Sciences › Engineering › Building and Construction › Urban and Freight Transport Logistics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- pickup and delivery problem, pickup and delivery problem with time windows, column generation, branch-price-and-cut, dominance rules, vehicle routing
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
