Shortest path problem with forbidden paths: the elementary version

DOI10.1016/j.ejor.2012.11.010zbMath1292.90246DBLPjournals/eor/PuglieseG13OpenAlexW2058036230WikidataQ58921173 ScholiaQ58921173MaRDI QIDQ2509518

Luigi Di Puglia Pugliese, Francesca Guerriero

Publication date: 28 July 2014

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.11.010

zbMATH Keywords

combinatorial optimizationshortest pathsbranch and bound approachdynamic programming approachforbidden paths

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Dynamic programming (90C39) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (9)

The constrained shortest path problem with stochastic correlated link travel times ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ Shortest path tour problem with time windows ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ On the shortest path problem with negative cost cycles ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Finding Paths in Grids with Forbidden Transitions ⋮ Solving the shortest path tour problem

Uses Software

• NETGEN

This page was built for publication: Shortest path problem with forbidden paths: the elementary version