The capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The capacitated minimum spanning tree problem: On improved multistar constraints |
scientific article; zbMATH DE number 2117489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The capacitated minimum spanning tree problem: On improved multistar constraints |
scientific article; zbMATH DE number 2117489 |
Statements
The capacitated minimum spanning tree problem: On improved multistar constraints (English)
0 references
22 November 2004
0 references
Capacitated trees
0 references
Multistar constraints
0 references
Subset sum problems
0 references
Valid inequalities
0 references
Lagrangean relaxation
0 references
0 references
0 references
0 references
0.8947960734367371
0 references
0.8530896902084351
0 references
0.8339195251464844
0 references
0.8272718787193298
0 references
0.817476212978363
0 references
