On Minimum Reload Cost Cycle Cover (Q2883554): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On minimum reload cost paths, tours, and flows / 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: Q4198056 / 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

Latest revision as of 04:23, 5 July 2024

scientific article
Language Label Description Also known as
English
On Minimum Reload Cost Cycle Cover
scientific article

    Statements

    On Minimum Reload Cost Cycle Cover (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    network optimization
    0 references
    reload cost model
    0 references
    computational complexity
    0 references

    Identifiers