Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PERL / rank | |||
Normal rank | |||
Revision as of 17:25, 29 February 2024
scientific article; zbMATH DE number 6107798
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs |
scientific article; zbMATH DE number 6107798 |
Statements
Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (English)
0 references
15 November 2012
0 references
spanning tree
0 references
discretized reformulation
0 references
knapsack reformulation
0 references
GRASP
0 references
VNS
0 references
