An algorithm for node-capacitated ring routing (Q2467482): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Edge-disjoint paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Capacitated Ring Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for edge-disjoint paths in planar graphs / rank
 
Normal rank

Latest revision as of 15:39, 27 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for node-capacitated ring routing
scientific article

    Statements

    An algorithm for node-capacitated ring routing (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    multicommodity flow
    0 references
    Fourier-Motzkin elimination
    0 references

    Identifiers