A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
From MaRDI portal
Publication:937408
DOI10.1016/j.disopt.2008.01.002zbMath1140.90481OpenAlexW2087284990MaRDI QIDQ937408
Christophe Duhamel, Jérôme Truffot
Publication date: 15 August 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2008.01.002
Related Items (7)
A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ 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 ⋮ k -Splittable delay constrained routing problem: A branch-and-price approach ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum-cost single-source 2-splittable flow
- An exact algorithm for IP column generation
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Improving Discrete Model Representations via Symmetry Considerations
- Decomposition Principle for Linear Programs
- An Automatic Method of Solving Discrete Programming Problems
- Selected Topics in Column Generation
- Algorithms – ESA 2004
- A tree-search algorithm for mixed integer programming problems
- Approximation and Online Algorithms
This page was built for publication: A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
