Separating tight metric inequalities by bilevel programming (Q1939716): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:42, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating tight metric inequalities by bilevel programming |
scientific article |
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
