A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445)
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 7242104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polyhedral study of the diameter constrained minimum spanning tree problem |
scientific article; zbMATH DE number 7242104 |
Statements
A polyhedral study of the diameter constrained minimum spanning tree problem (English)
0 references
31 August 2020
0 references
integer programming
0 references
diameter constrained trees
0 references
facet
0 references
0 references
0.8269311785697937
0 references
0.8163281679153442
0 references
0.8030341267585754
0 references
0.7989095449447632
0 references
0.7920243144035339
0 references