Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (Q1919978)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 910354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints |
scientific article; zbMATH DE number 910354 |
Statements
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (English)
0 references
19 January 1997
0 references
Hop constrained minimal spanning tree
0 references
subtour elimination
0 references
liftings
0 references
Lagrangean relaxation
0 references
subgradient optimization
0 references
0.945392906665802
0 references
0.9173557162284852
0 references
0.8765568137168884
0 references
0.8286391496658325
0 references
