Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem (Q439370): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the maximum concurrent \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-cost single-source 2-splittable flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows on few paths: Algorithms and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-source \(k\)-splittable min-cost flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Price algorithm for the \(k\)-splittable maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i> -Splittable delay constrained routing problem: A branch-and-price approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path problem with forbidden paths / rank
 
Normal rank

Latest revision as of 14:12, 5 July 2024

scientific article
Language Label Description Also known as
English
Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem
scientific article

    Statements

    Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem (English)
    0 references
    0 references
    0 references
    16 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    branch and bound
    0 references
    combinatorial optimization
    0 references
    multi-commodity flow
    0 references
    \(k\)-splittable
    0 references
    dantzig
    0 references
    Wolfe decomposition
    0 references
    heuristic
    0 references
    0 references