Separating tight metric inequalities by bilevel programming (Q1939716): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2012.09.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987357293 / rank | |||
Normal rank | |||
Revision as of 00:51, 20 March 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
