On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows (Q6065863)
From MaRDI portal
scientific article; zbMATH DE number 7775508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows |
scientific article; zbMATH DE number 7775508 |
Statements
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows (English)
0 references
11 December 2023
0 references
approximation hardness
0 references
attacker-defender problem
0 references
bilevel programming
0 references
minimum cost flow
0 references
network interdiction
0 references
parametrized flow problems
0 references
0 references
