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
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/net.20445 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2153740982 / rank | |||
Normal rank |
Revision as of 03:42, 20 March 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