Inverse problem of minimum cuts
From MaRDI portal
Publication:1298756
DOI10.1007/BF01193836zbMath0941.90013OpenAlexW2019571312MaRDI QIDQ1298756
Mao-cheng Cai, Zhang, Jianzhong
Publication date: 7 August 2000
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01193836
Related Items
Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ Inverse minimum flow problem ⋮ Some inverse optimization problems on network ⋮ Inverse optimization in high-speed networks ⋮ Unnamed Item ⋮ Notes on inverse bin-packing problems ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem ⋮ Robust partial inverse network flow problems ⋮ The inverse maximum flow problem consideringl∞norm ⋮ Inverse conic programming with applications ⋮ The partial inverse minimum cut problem withL1-norm is strongly NP-hard ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ Inverse feasibility problems of the inverse maximum flow problems
Cites Work
- Unnamed Item
- Unnamed Item
- A strongly polynomial minimum cost circulation algorithm
- On an instance of the inverse shortest paths problem
- Inverse matroid intersection problem
- An inverse problem of the weighted shortest path problem
- Calculating some inverse linear programming problems
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Inverse maximum flow and minimum cut problems
- A column generation method for inverse shortest path problems
- A network flow method for solving some inverse combinatorial optimization problems
This page was built for publication: Inverse problem of minimum cuts
