Dynamic programming approaches to solve the shortest path problem with forbidden paths
From MaRDI portal
Publication:4924113
DOI10.1080/10556788.2011.630077zbMath1271.90093OpenAlexW2033829723WikidataQ58921148 ScholiaQ58921148MaRDI QIDQ4924113
Luigi Di Puglia Pugliese, Francesca Guerriero
Publication date: 30 May 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.630077
Related Items (7)
The \(k\)-dissimilar vehicle routing problem ⋮ Feeder routing for air-to-air refueling operations ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ An approximation algorithm for the longest path problem in solid grid graphs ⋮ Solving the shortest path tour problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- The shortest path problem with forbidden paths
- An algorithm for ranking paths that may contain cycles
- Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
- A reoptimization algorithm for the shortest path problem with time windows
- Shortest paths algorithms: Theory and experimental evaluation
- Resource extension functions: properties, inversion, and generalization to segments
- Shortest path problem with forbidden paths: the elementary version
- On the Shortest Route Through a Network
- Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
- Shortest-path algorithms: Taxonomy and annotation
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- An algorithm for the resource constrained shortest path problem
- A dual algorithm for the constrained shortest path problem
- Efficient string matching
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Efficient Algorithms for Solving the Shortest Covering Path Problem
This page was built for publication: Dynamic programming approaches to solve the shortest path problem with forbidden paths
