Solving the bi-objective maximum-flow network-interdiction problem (Q2892322)
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: Solving the bi-objective maximum-flow network-interdiction problem |
scientific article; zbMATH DE number 6047440
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the bi-objective maximum-flow network-interdiction problem |
scientific article; zbMATH DE number 6047440 |
Statements
18 June 2012
0 references
interdiction
0 references
maximum flow
0 references
Lagrangian relaxation
0 references
cut enumeration
0 references
Solving the bi-objective maximum-flow network-interdiction problem (English)
0 references
