New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2010.05.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2010.05.003 / rank | |||
Normal rank | |||
Latest revision as of 01:29, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints |
scientific article |
Statements
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (English)
0 references
15 October 2010
0 references
Miller-Tucker-Zemlin constraints
0 references
spanning trees
0 references
network flows
0 references
integer programming
0 references
hop constraints
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
