A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem (Q2448170): 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: Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-splittable \(s, t\)-flows / 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: An augmented Lagrangian algorithm for large scale multicommodity routing / 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

Latest revision as of 11:52, 8 July 2024

scientific article
Language Label Description Also known as
English
A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem
scientific article

    Statements

    Identifiers