Complexity of partial inverse assignment problem and partial inverse cut problem
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- The partial inverse minimum cut problem with L₁-norm is strongly NP-hard
- Partial inverse assignment problems under \(l_{1}\) norm
- Robust partial inverse network flow problems
- Algorithms for the partial inverse matroid problem in which weights can only be increased
- Weighted inverse minimum cut problem under the sum-type Hamming distance
Cites work
- A network flow method for solving some inverse combinatorial optimization problems
- Combinatorial algorithms for inverse network flow problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Inverse maximum flow and minimum cut problems
- Inverse polymatroidal flow problem
- Inverse problem of minimum cuts
- Inverse problems of submodular functions on digraphs
Cited in
(15)- A branch-and-bound algorithm for instrumental variable quantile regression
- Partial inverse maximum spanning tree in which weight can only be decreased under l_p-norm
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms
- Partial inverse maximum spanning tree problem under the Chebyshev norm
- Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- Partial inverse assignment problems under \(l_{1}\) norm
- The partial inverse minimum cut problem with L₁-norm is strongly NP-hard
- Algorithms for the partial inverse matroid problem in which weights can only be increased
- Robust partial inverse network flow problems
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased
This page was built for publication: Complexity of partial inverse assignment problem and partial inverse cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765604)
