Abstract
The inverse shortest path problem has received considerable attention in the literature since the seminal paper by Burton and Toint from 1992. Given a graph and a set of paths the problem is to find arc costs such that all specified paths are shortest paths. The quality of the arc costs is measured by the deviation from some ideal arc costs. Our contribution is a novel modeling technique for this problem based on fundamental cycle bases. For ’LP compatible’ norms we present a cycle basis model equivalent to the LP dual. The LP dual of our cycle basis model is a path based model that only requires a polynomial number of path constraints. This model is valid also for ’LP incompatible’ norms. This yields the first polynomial sized path formulation of the original problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, R.J., Setubal, J.C.: On the parallel implementation of Goldberg’s maximum flow algorithm. In: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, SPAA’92, pp. 168-177, ACM (1992)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman (1979)
Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM. 35, 921–940 (1988)
Goldfarb, D., Grigoriadis, M.D.: A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow. Annals of Operations Research. 78, 83–123 (1988)
Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press (1995)
Haugland, D., Eleyat, M., Hetland, M.L.: The maximum flow problem with minimum lot sizes. In: Proceedings of the Second international conference on Computational logistics, ICCL’11, pp. 170-182. Springer-Verlag (2011)
Hong, B., He, Z.: An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic. IEEE Trans. Parallel Distrib. Syst. 22, 1025–1033 (2011)
Jungnickel, D.: Graphs, Networks and Algorithms. Springer (2008)
Karzanov, A.V.: Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15, 434–437 (1975)
Parmar, P.: Integer Programming Approaches for Equal-Split Network Flow Problems. PhD thesis, Georgia Institute of Technology (2007)
Shiloach, Y., Vishkin, U.: An O(n2 logn) parallel max-flow algorithm. Journal of Algorithms. 3, 128–146 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Call, M., Holmberg, K. (2012). Inverse Shortest Path Models Based on Fundamental Cycle Bases. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-29210-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29209-5
Online ISBN: 978-3-642-29210-1
eBook Packages: Business and EconomicsBusiness and Management (R0)