Inverse Shortest Path Models Based on Fundamental Cycle Bases

DOI10.1007/978-3-642-29210-1_13zbMath1306.90163OpenAlexW1885029882MaRDI QIDQ5176285

Kaj Holmberg, Mikael Call

Publication date: 3 March 2015

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_13

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs, networks and algorithms
• A new approach to the maximum-flow problem
• An O(n2log n) parallel max-flow algorithm
• Parallel algorithms for the maximum flow problem with minimum lot sizes

This page was built for publication: Inverse Shortest Path Models Based on Fundamental Cycle Bases