On the complexity of constructing minimum changeover cost arborescences (Q2453161)
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: On the complexity of constructing minimum changeover cost arborescences |
scientific article; zbMATH DE number 6301565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of constructing minimum changeover cost arborescences |
scientific article; zbMATH DE number 6301565 |
Statements
On the complexity of constructing minimum changeover cost arborescences (English)
0 references
6 June 2014
0 references
reload cost
0 references
changeover cost
0 references
approximation algorithms
0 references
network design
0 references
network optimization
0 references
0.9031605124473572
0 references
0.8969132900238037
0 references
0.8807406425476074
0 references
0.8628619909286499
0 references
