A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
From MaRDI portal
Publication:845550
DOI10.1007/s11590-009-0147-4zbMath1180.90345OpenAlexW1966258309MaRDI QIDQ845550
Antonino Sgalambro, Massimiliano Caramia
Publication date: 29 January 2010
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-009-0147-4
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(k\)-splittable flow problem
- Multiterminal global routing: A deterministic approximation scheme
- An exact approach for the maximum concurrent \(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
- A survey on multi-net global routing for integrated circuits
- The flow deviation method: An approach to store‐and‐forward communication network design
- Flows on few paths: Algorithms and lower bounds
- Integer Programming and Combinatorial Optimization
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Approximation and Online Algorithms
- New hardness results for congestion minimization and machine scheduling