Inverse shortest path models based on fundamental cycle bases

DOI10.1007/978-3-642-29210-1_13MaRDI QIDQ5176285zbMATH OpenOpenAlexFDO

Authors Mikael Call, Kaj Holmberg

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

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

Recommendations

• On an instance of the inverse shortest paths problem
• Inverse Optimization
• A column generation method for inverse shortest path problems
• scientific article; zbMATH DE number 815126
• A strongly polynomial algorithm for the inverse shortest arborescence problem

Cites work

• A new approach to the maximum-flow problem
• An O(n2log n) parallel max-flow algorithm
• Graphs, networks and algorithms
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• Parallel algorithms for the maximum flow problem with minimum lot sizes

Cited in

(1)

• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs

This page was built for publication: Inverse shortest path models based on fundamental cycle bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176285)