Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284)
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: Lagrangian and branch-and-cut approaches for upgrading spanning tree problems |
scientific article; zbMATH DE number 6901410
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lagrangian and branch-and-cut approaches for upgrading spanning tree problems |
scientific article; zbMATH DE number 6901410 |
Statements
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (English)
0 references
11 July 2018
0 references
spanning tree problems
0 references
integer programming
0 references
Lagrangian relaxation
0 references
0 references
0 references
