A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem

DOI10.1007/s11590-013-0622-9zbMath1292.90303MaRDI QIDQ2448170

Mette Gamst

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0622-9

zbMATH Keywords

shortest path; meta-heuristic; local search heuristic; multi-commodity flow; \(k\)-splittable flow

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem

Cites Work

• Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem
• The \(k\)-splittable flow problem
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
• Maximum \(k\)-splittable \(s, t\)-flows
• An exact approach for the maximum concurrent \(k\)-splittable flow problem
• A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
• Single-source \(k\)-splittable min-cost flows
• Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
• Minimum-cost single-source 2-splittable flow
• An augmented Lagrangian algorithm for large scale multicommodity routing
• Flows on few paths: Algorithms and lower bounds