Inverse maximum flow and minimum cut problems

DOI10.1080/02331939708844306zbMath0880.90041OpenAlexW1986946117MaRDI QIDQ4338054

Zhang, Jianzhong, Zhongfan Ma, Chao Yang

Publication date: 28 May 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939708844306

zbMATH Keywords

inverse maximum flowinverse minimum cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Inverse conic linear programs in Banach spaces ⋮ Input estimation and identification of extra inputs in inverse DEA models ⋮ Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ Inverse maximum flow problems under the weighted Hamming distance ⋮ Inverse minimum flow problem ⋮ The inverse parallel machine scheduling problem with minimum total completion time ⋮ Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm ⋮ Some inverse optimization problems on network ⋮ A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE ⋮ Inverse optimization in high-speed networks ⋮ The inverse maximum dynamic flow problem ⋮ Notes on inverse bin-packing problems ⋮ An inverse DEA model for inputs/outputs estimate ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ The minmax regret inverse maximum weight problem ⋮ An algorithm for inverse minimum spanning tree problem ⋮ A generalized DEA model for inputs/outputs estimation ⋮ Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ Robust partial inverse network flow problems ⋮ Capacity inverse minimum cost flow problem ⋮ The inverse maximum flow problem consideringl_∞norm ⋮ Note on inverse problem with \(l_\infty\) objective function ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ Inverse problem of minimum cuts ⋮ A further study on inverse linear programming problems ⋮ Inverse feasibility problems of the inverse maximum flow problems

Cites Work

• On an instance of the inverse shortest paths problem
• An inverse problem of the weighted shortest path problem
• A column generation method for inverse shortest path problems
• A network flow method for solving some inverse combinatorial optimization problems