The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs (Q2050253)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs |
scientific article; zbMATH DE number 7388209
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs |
scientific article; zbMATH DE number 7388209 |
Statements
The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs (English)
0 references
30 August 2021
0 references
network interdiction
0 references
dynamic programming
0 references
multicriteria optimization
0 references
