The following pages link to Inverse problem of minimum cuts (Q1298756):
Displaying 21 items.
- Inverse feasibility problems of the inverse maximum flow problems (Q261056) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Some inverse optimization problems on network (Q394471) (← links)
- Notes on inverse bin-packing problems (Q458387) (← links)
- Inverse minimum flow problem (Q874337) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- Inverse maximum capacity problems (Q1387947) (← links)
- Inverse optimization in high-speed networks (Q1399112) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- Some reverse location problems (Q1576337) (← links)
- Inverse conic programming with applications (Q1779714) (← links)
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance (Q2240118) (← links)
- Complexity of partial inverse assignment problem and partial inverse cut problem (Q2765604) (← links)
- Minimax inverse problems of minimum cuts (Q2782726) (← links)
- The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard (Q3057531) (← links)
- The inverse maximum flow problem considering<i>l</i><sub>∞</sub>norm (Q3598045) (← links)
- Inverse maximum flow and minimum cut problems (Q4338054) (← links)
- Combinatorial algorithms for inverse network flow problems (Q4798190) (← links)
- (Q5009558) (← links)
- Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization (Q5058012) (← links)
- Robust partial inverse network flow problems (Q5943384) (← links)
