The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720)
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: The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm |
scientific article; zbMATH DE number 2056986
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm |
scientific article; zbMATH DE number 2056986 |
Statements
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (English)
0 references
15 March 2004
0 references
generalized minimum spanning tree
0 references
network design
0 references
telecommunications
0 references
polyhedral analysis
0 references
branch-and-cut algorithm
0 references
tabu search heuristic
0 references
0 references
0.9421724081039428
0 references
0.9126800298690796
0 references
0.9082320928573608
0 references
0.908158838748932
0 references
0.9056288599967957
0 references
