On minimum reload cost paths, tours, and flows (Q3008920): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.20423 / rank | |||
| Property / cites work | |||
| Property / cites work: Q4258216 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of a minimum reload cost diameter problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reload cost trees and network design / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Minimum Reload s-t Path/Trail/Walk Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reload cost problems: Minimum diameter spanning tree / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.20423 / rank | |||
Normal rank | |||
Latest revision as of 08:11, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On minimum reload cost paths, tours, and flows |
scientific article |
Statements
On minimum reload cost paths, tours, and flows (English)
0 references
22 June 2011
0 references
network optimization
0 references
extended reload cost model
0 references
computational complexity
0 references
