A branch and cut method for the degree-constrained minimum spanning tree problem (Q2714906)
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 1607391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and cut method for the degree-constrained minimum spanning tree problem |
scientific article; zbMATH DE number 1607391 |
Statements
20 June 2001
0 references
branch and cut
0 references
combinatorial optimization
0 references
optimal trees
0 references
mixed integer linear programming
0 references
network design
0 references
A branch and cut method for the degree-constrained minimum spanning tree problem (English)
0 references
0.8985049724578857
0 references
0.8936809301376343
0 references
0.8866575360298157
0 references
0.8697911500930786
0 references
