Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using Lagrangian dual information to generate degree constrained spanning trees |
scientific article |
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
