The shortest-path problem with resource constraints with -loop elimination and its application to the capacitated arc-routing problem-Reference-Cited by-同舟云学术

The shortest-path problem with resource constraints with -loop elimination and its application to the capacitated arc-routing problem

Published:2014-10 Issue:2 Volume:238 Page:415-426
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Bode Claudia,Irnich Stefan

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference32 articles.

1. Network flows: Theory, algorithms, and applications;Ahuja,1993

2. New route relaxation and pricing strategies for the vehicle routing problem;Baldacci;Operations Research,2011

3. New state-space relaxations for solving the traveling salesman problem with time windows;Baldacci;INFORMS Journal on Computing,2011

4. Improved lower bounds and exact algorithm for the capacitated arc routing problem;Bartolini;Mathematical Programming,2012

5. An exact algorithm for the capacitated arc routing problem with deadheading demand;Bartolini;Operations Research,2013

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff;OR Spectrum;2024-06-26

2. Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem;INFORMS Journal on Computing;2023-01

3. SPCS: Strong Privacy-Preserving-Constrained Shortest Distance Queries on Encrypted Graphs;IEEE Internet of Things Journal;2022-11-15

4. Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem;Transportation Science;2021-05

5. A shortest path problem in a stochastic network with exponential travel time;International Journal of Applied Management Science;2021