Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522): Difference between revisions
From MaRDI portal
Latest revision as of 02:28, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints |
scientific article |
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