The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (Q2230399)
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 7396864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms |
scientific article; zbMATH DE number 7396864 |
Statements
The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (English)
0 references
17 September 2021
0 references
combinatorial optimization
0 references
integer programming
0 references
spanning trees
0 references
discrete geometry
0 references
arrangements
0 references
0 references
0 references
0 references
0 references
0.7855969071388245
0 references
0.7759585380554199
0 references
0.7694036960601807
0 references
0.7666325569152832
0 references
