On the complexity of constructing minimum changeover cost arborescences (Q2453161): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.03.023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012371405 / rank | |||
Normal rank | |||
Revision as of 19:50, 19 March 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
