On the minimum cost multiple-source unsplittable flow problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3578640 (Why is no real title available?)
- scientific article; zbMATH DE number 3354799 (Why is no real title available?)
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A note on the greedy algorithm for the unsplittable flow problem
- A technical review of column generation in integer programming
- An Integer Programming Approach to the Bandwidth Packing Problem
- An overtraining-resistant stochastic modeling method for pattern recognition
- Approximating the single source unsplittable min-cost flow problem
- Approximation algorithms for single-source unsplittable flow
- Bandwidth Packing: A Tabu Search Approach
- Branch-and-price: Column generation for solving huge integer programs
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Corner polyhedra and their connection with cutting planes
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- On the single-source unsplittable flow problem
- Path assignment for call routing: An application of tabu search
- Routing Through Virtual Paths in Layered Telecommunication Networks
- Selected Topics in Column Generation
- The Ring Loading Problem
- The \(k\)-splittable flow problem
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
Cited in
(10)- Models for the piecewise linear unsplittable multicommodity flow problems
- Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances
- Single-source \(k\)-splittable min-cost flows
- Minimum-cost single-source 2-splittable flow
- On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
- Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks
- On the single-source unsplittable flow problem
- Fractional routing using pairs of failure-disjoint paths
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
This page was built for publication: On the minimum cost multiple-source unsplittable flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004201)
