Inverse maximum flow and minimum cut problems

DOI10.1080/02331939708844306MaRDI QIDQ4338054zbMATH OpenOpenAlexFDO

Authors Chao Yang, Jianzhong Zhang, Zhongfan Ma

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

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

Recommendations

• Inverse maximum flow problem in planar networks
• Inverse minimum flow problem
• Inverse feasibility problems of the inverse maximum flow problems
• The inverse maximum flow problem with lower and upper bounds for the flow
• A solution to the inverse minimum cut problem in dynamic network flows
• Inverse maximum flow problems under the combining norms
• The inverse maximum dynamic flow problem
• A cardinality inverse maximum flow problem
• Inverse problem of minimum cuts
• Minimax inverse problems of minimum cuts

Cites work

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

Cited in

(44)

• Inverse optimization for linearly constrained convex separable programming problems
• Recognizing max-flow min-cut path matrices
• Note on inverse problem with l_ objective function
• Inverse problem of minimum cuts
• A further study on inverse linear programming problems
• Inverse maximum capacity problems
• Inverse optimization in high-speed networks
• Inverse problems of submodular functions on digraphs
• Some reverse location problems
• Input estimation and identification of extra inputs in inverse DEA models
• An inverse DEA model for inputs/outputs estimate
• Inverse minimum flow problem under the weighted sum-type Hamming 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
• Capacity inverse minimum cost flow problem
• Inverse maximum flow problems under the weighted Hamming distance
• A generalized DEA model for inputs/outputs estimation
• Inverse feasibility problems of the inverse maximum flow problems
• Complexity of partial inverse assignment problem and partial inverse cut problem
• Minimax inverse problems of minimum cuts
• Maximum cuts for a minimum flow
• A solution to the inverse minimum cut problem in dynamic network flows
• The inverse maximum flow problem under weighted l_ norm
• A cardinality inverse maximum flow problem
• Inverse chromatic number problems in interval and permutation graphs
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• The inverse maximum flow problem consideringl_∞norm
• The inverse maximum flow problem with lower and upper bounds for the flow
• The inverse parallel machine scheduling problem with minimum total completion time
• Some inverse optimization problems on network
• An algorithm for inverse minimum spanning tree problem
• Notes on inverse bin-packing problems
• Reverse maximum flow problem under the weighted Chebyshev distance
• Combinatorial algorithms for inverse network flow problems
• Inverse maximum flow problem in planar networks
• Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization
• Robust partial inverse network flow problems
• The inverse maximum dynamic flow problem
• A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance
• Inverse optimization in semi-definite programs to impute unknown constraint matrices
• Inverse conic linear programs in Banach spaces
• Inverse minimum flow problem
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• The inverse 1-maxian problem with edge length modification

This page was built for publication: Inverse maximum flow and minimum cut problems

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