Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem (Q2168733)
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 7576486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem |
scientific article; zbMATH DE number 7576486 |
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
0.9086166620254515
0 references
0.7998562455177307
0 references
0.7989199757575989
0 references
0.7957320213317871
0 references
0.7944055795669556
0 references
