An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem

DOI10.1016/j.endm.2006.06.056zbMath1134.90513OpenAlexW2014714999MaRDI QIDQ3439461

H. Bricard

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.2006.06.056

zbMATH Keywords

graphconstrained kSPdeviation algorithmsdownstream logistics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A new implementation of Yen's ranking loopless paths algorithm
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem