The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (Q1772873)
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 2160319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The capacitated minimum spanning tree problem: revisiting hop-indexed formulations |
scientific article; zbMATH DE number 2160319 |
Statements
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (English)
0 references
21 April 2005
0 references
Capacitated spanning trees
0 references
Hop-indexed formulations
0 references
Generalized subtour elimination constraints
0 references
Cutting plane algorithms
0 references
0 references
0.9104934334754944
0 references
0.8975443243980408
0 references
0.8542448878288269
0 references
0.8339195251464844
0 references
