Abstract
A biobjective extension of the maximum flow network interdiction problem is considered: Two maximum flows from source to sink are to be computed independently from each other while an interdictor aims to reduce the value of both maximum flows simultaneously by interdicting arcs. We show that this problem is intractable and propose two procedures to solve this problem on specific graph classes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River (1993)
Assimakopoulos, N. (1987). A network interdiction model for hospital infection control. Comput. Biol. Med. 17(6), 413–422
Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9), 1124–1137 (2004)
Burch, C., Carr, R., Krumke, S., Marathe, M., Phillips, C., Sundberg, E.: A decomposition-based pseudoapproximation algorithm for network flow inhibition. In: Network Interdiction and Stochastic Integer Programming, pp. 51–68. Springer, Berlin (2003)
Carstensen, P.J.: Complexity of some parametric integer and network programming problems. Math. Program. 26(1), 64–75 (1983)
Chestnut, S.R., Zenklusen, R.: Hardness and approximation for network flow interdiction. Networks 69(4), 378–387 (2017)
Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)
Eppstein, D.: Parallel recognition of series-parallel graphs. Inf. Comput. 98(1), 41–55 (1992)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8(3), 399–404 (1956)
Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. wh freeman, New York (2002)
Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 86–92. IEEE, New York (2000)
Phillips, C.A.: The network inhibition problem. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 776–785. ACM, New York (1993)
Safer, H.M., et al.: Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. Technical report, Massachusetts Institute of Technology (MIT), New York. Sloan School of Management
Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298–313 (1982)
Wood, R.K.: Deterministic network interdiction. Math. Comput. Model. 17(2), 1–18 (1993)
Acknowledgements
This work was partially supported by the Bundesministerium für Bildung und Forschung (BMBF) under Grant No. 13N14561.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Schäfer, L.E., Dietz, T., Natale, M.V., Ruzika, S., Krumke, S.O., Fonseca, C.M. (2020). The Bicriterion Maximum Flow Network Interdiction Problem in s-t-Planar Graphs. In: Neufeld, J.S., Buscher, U., Lasch, R., Möst, D., Schönberger, J. (eds) Operations Research Proceedings 2019. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-48439-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-48439-2_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-48438-5
Online ISBN: 978-3-030-48439-2
eBook Packages: Business and ManagementBusiness and Management (R0)