The following pages link to The \(k\)-splittable flow problem (Q818654):
Displayed 15 items.
- Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem (Q439370) (← links)
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
- Complexity and approximability of \(k\)-splittable flows (Q861276) (← links)
- Maximum \(k\)-splittable \(s, t\)-flows (Q927403) (← links)
- An exact approach for the maximum concurrent \(k\)-splittable flow problem (Q928300) (← links)
- On the approximation of the single source \(k\)-splittable flow problem (Q935843) (← links)
- Single-source \(k\)-splittable min-cost flows (Q1015297) (← links)
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
- Approximating the \(k\)-splittable capacitated network design problem (Q1751198) (← links)
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem (Q2286869) (← links)
- A polynomial time approximation algorithm for the two-commodity splittable flow problem (Q2392809) (← links)
- (Arc-)disjoint flows in networks (Q2437760) (← links)
- A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem (Q2448170) (← links)
- On the minimum cost multiple-source unsplittable flow problem (Q3004201) (← links)
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)