An exact approach for the maximum concurrent \(k\)-splittable flow problem

DOI10.1007/s11590-007-0055-4zbMath1139.90009OpenAlexW1969620795MaRDI QIDQ928300

Massimiliano Caramia, Antonino Sgalambro

Publication date: 11 June 2008

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

Full work available at URL: https://doi.org/10.1007/s11590-007-0055-4

zbMATH Keywords

branch and boundmixed integer programmingthroughput\(k\)-splittable flowmulticommodity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (6)

A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem ⋮ A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem ⋮ Service network design models for two-tier city logistics ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem

Cites Work

• Unnamed Item
• The \(k\)-splittable flow problem
• On the approximation of the single source \(k\)-splittable flow problem
• Minimum-cost single-source 2-splittable flow
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• On the single-source unsplittable flow problem
• An overtraining-resistant stochastic modeling method for pattern recognition
• Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
• Approximating the single source unsplittable min-cost flow problem
• The maximum concurrent flow problem
• Hardness of the undirected congestion minimization problem
• Flows on few paths: Algorithms and lower bounds
• Approximation and Online Algorithms
• New hardness results for congestion minimization and machine scheduling

This page was built for publication: An exact approach for the maximum concurrent \(k\)-splittable flow problem