On the complexity of constructing minimum changeover cost arborescences (Q2453161): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2014.03.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.03.023 / rank | |||
Normal rank | |||
Latest revision as of 17:48, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of constructing minimum changeover cost arborescences |
scientific article |
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
