A Class of Label-Correcting Methods for the K Shortest Paths Problem
From MaRDI portal
Publication:3635012
DOI10.1287/opre.49.3.423.11217zbMath1163.90771OpenAlexW2170060541WikidataQ58921772 ScholiaQ58921772MaRDI QIDQ3635012
V. Lacagnina, A. Pecorella, Francesca Guerriero, Roberto Musmanno
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.49.3.423.11217
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (7)
Parallel asynchronous algorithms for the \(K\) shortest paths problem ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool ⋮ The \(k\)-centrum shortest path problem ⋮ On the shortest path problem with negative cost cycles ⋮ Path finding approaches and metabolic pathways ⋮ Solving the shortest path tour problem
Uses Software
This page was built for publication: A Class of Label-Correcting Methods for the K Shortest Paths Problem
