Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
DOI10.1051/ro:2001106zbMath0993.90068OpenAlexW2131390263MaRDI QIDQ2765604
Publication date: 2001
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_1_117_0
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (13)
Cites Work
- Inverse problem of minimum cuts
- Inverse polymatroidal flow problem
- Inverse problems of submodular functions on digraphs
- Inverse maximum flow and minimum cut problems
- Combinatorial algorithms for inverse network flow problems
- A network flow method for solving some inverse combinatorial optimization problems
- Unnamed Item
This page was built for publication: Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem