Separating tight metric inequalities by bilevel programming (Q1939716)
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: Separating tight metric inequalities by bilevel programming |
scientific article; zbMATH DE number 6141244
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separating tight metric inequalities by bilevel programming |
scientific article; zbMATH DE number 6141244 |
Statements
Separating tight metric inequalities by bilevel programming (English)
0 references
5 March 2013
0 references
network design
0 references
capacity formulation
0 references
cutting planes
0 references
0 references
0 references
0 references
0.9013548
0 references
0.87456644
0 references
0.8680728
0 references
0 references
0.86441225
0 references
0.86441225
0 references
0.85856473
0 references
