Dynamic programming algorithms for the elementary shortest path problem with resource constraints

DOI10.1016/j.endm.2004.03.047zbMath1125.90420OpenAlexW2030686621MaRDI QIDQ3439161

Matteo Salani, Giovanni Righini

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.047

zbMATH Keywords

dynamic programmingshortest pathcolumn generationvehicle routing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (3)

A column generation approach for a multi-attribute vehicle routing problem ⋮ Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels ⋮ Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for the resource constrained shortest path problem
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

This page was built for publication: Dynamic programming algorithms for the elementary shortest path problem with resource constraints