Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896)
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 5021006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using Lagrangian dual information to generate degree constrained spanning trees |
scientific article; zbMATH DE number 5021006 |
Statements
Using Lagrangian dual information to generate degree constrained spanning trees (English)
0 references
28 April 2006
0 references
Lagrangian heuristic
0 references
Heuristic improvement procedure
0 references
Restricted problem
0 references
Infeasibility prevention
0 references
0 references
0 references
0.8976659
0 references
0.8687588
0 references
0.8622699
0 references
0.8611206
0 references
0.85583246
0 references
0.85531366
0 references
