New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141)
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: New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints |
scientific article; zbMATH DE number 5800809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints |
scientific article; zbMATH DE number 5800809 |
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
0.978445827960968
0 references
0.9173557162284852
0 references
0.8723626136779785
0 references
0.8429487347602844
0 references
