Separating tight metric inequalities by bilevel programming (Q1939716): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2012.09.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2012.09.009 / rank | |||
Normal rank | |||
Latest revision as of 14:16, 16 December 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
0 references
0 references
0 references
