On minimum reload cost paths, tours, and flows (Q3008920): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 05:41, 4 July 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
    0 references
    0 references
    0 references
    0 references
    22 June 2011
    0 references
    network optimization
    0 references
    extended reload cost model
    0 references
    computational complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references