A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
From MaRDI portal
Publication:4540047
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A" /><193::AID-NET6>3.0.CO;2-A 10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-AzbMath1002.90084OpenAlexW2053697731MaRDI QIDQ4540047
Jacques Desrosiers, François Soumis, Irina Ioachim, Sylvie Gélinas
Publication date: 21 July 2002
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199805)31:3<193::aid-net6>3.0.co;2-a
Related Items (29)
Column generation approaches to ship scheduling with flexible cargo sizes ⋮ Path Problems in Complex Networks ⋮ Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price ⋮ Arc routing problems with time-dependent service costs ⋮ Multi-objective and multi-constrained non-additive shortest path problems ⋮ Selective routing problem with synchronization ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems ⋮ Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows ⋮ Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ Branch-and-price approaches for the multiperiod technician routing and scheduling problem ⋮ Resource extension functions: properties, inversion, and generalization to segments ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation ⋮ A column generation algorithm for the vehicle routing problem with soft time windows ⋮ Ship scheduling with soft time windows: An optimisation based approach ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ The shortest path problem with forbidden paths ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Fleet assignment and routing with schedule synchronization constraints ⋮ Multi-depot vehicle scheduling problems with time windows and waiting costs ⋮ Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem ⋮ The vehicle routing problem with time windows and temporal dependencies ⋮ Shortest path with acceleration constraints: complexity and approximation algorithms
This page was built for publication: A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
