Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522)
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: Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints |
scientific article; zbMATH DE number 5616462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints |
scientific article; zbMATH DE number 5616462 |
Statements
Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (English)
0 references
16 October 2009
0 references
mixed integer programming
0 references
degree-enforcing constraints
0 references
Miller-Tucker-Zemlin constraints
0 references
minimum spanning tree
0 references
flow formulation
0 references
rooted arborescence
0 references
0 references
0 references
0 references
0.8875941634178162
0 references
0.8816072940826416
0 references
0.8792390823364258
0 references
0.8481842875480652
0 references
