The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321)
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 maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability |
scientific article; zbMATH DE number 5682957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability |
scientific article; zbMATH DE number 5682957 |
Statements
The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (English)
0 references
18 March 2010
0 references
network flows
0 references
integer programming
0 references
integrality gap
0 references
valid inequalities
0 references
0.845018744468689
0 references
0.8379756212234497
0 references
0.816000759601593
0 references
0.8131603598594666
0 references
0.7968763113021851
0 references
