Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem (Q5228505)
From MaRDI portal
scientific article; zbMATH DE number 7092066
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem |
scientific article; zbMATH DE number 7092066 |
Statements
Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem (English)
0 references
12 August 2019
0 references
adjacent only quadratic minimum spanning tree problem
0 references
projection
0 references
branch-and-cut algorithms
0 references
Lagrangian relaxation
0 references
