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 the normal view instead:
scientific article; zbMATH DE number 7388209
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8631656765937805
0 references
0.849301815032959
0 references
0.8189563155174255
0 references
0.8142886757850647
0 references
