Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem (Q2168733)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem |
scientific article |
Statements
Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem (English)
0 references
26 August 2022
0 references
combinatorial optimization
0 references
angular constrained spanning trees
0 references
stable set polytope
0 references
branch-and-cut algorithms
0 references
0 references
0 references
