Abstract
Given a network N(V,A,c) and a feasible flow x 0, an inverse maximum flow problem is to modify the capacity vector as little as possible to make x 0 form a maximum flow of the network. The modification can be measured by different norms. In this paper, we consider the inverse maximum flow problems under the combining norms, i.e., the modification cost is fixed in a given interval, and is depended on the modification out of the given interval. For both sum-type and bottleneck-type cases, we present their respective combinatorial algorithms that all run in strongly polynomial times.
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.
Similar content being viewed by others
References
Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New York (1993)
Burton, D., Toint, P.: On an instance of the inverse shortest paths problem. Mathematical Programming 53, 45–61 (1992)
He, Y., Zhang, B., Yao, E.: Wighted inverse minimum spanning tree problems under Hamming distance. Journal of Combinatorial Optimization 9, 91–100 (2005)
Heuberger, C.: Inverse Optimization: A survey on problems, methods, and results. Journal of Combinatorial Optimization 8, 329–361 (2004)
Liu, L., He, Y.: Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values. Progress in Natural Science 16, 649–655 (2006)
Liu, L., Yao, E.: A weighted inverse minimum cut problem under the bottleneck type Hamming distance. Asia-Pacific Journal of Operational Research 24, 725–736 (2007)
Liu, L., Zhang, J.: Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization 12, 395–408 (2006)
Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Berlin (2003)
Yang, C., Zhang, J., Ma, Z.: Inverse maximum flow and minimum cut problems. Optimization 40, 147–170 (1997)
Zhang, J., Xu, S., Ma, Z.: An algorithm for inverse minimum spanning tree problem. Optimization Methods and Software 8, 69–84 (1997)
Zhang, B., Zhang, J., Qi, L.: The shortest path improvement problems under Hamming distance. Journal of Combinatorial Optimization 12, 351–361 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L. (2013). Inverse Maximum Flow Problems under the Combining Norms. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-38756-2_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38755-5
Online ISBN: 978-3-642-38756-2
eBook Packages: Computer ScienceComputer Science (R0)