Multicommodity flow problems with a bounded number of paths: A flow deviation approach
From MaRDI portal
Publication:3418124
Recommendations
- Solving Multicommodity Flow Problems by an Approximation Scheme
- scientific article; zbMATH DE number 5592286
- On methods for the convex multi-commodity flow problem
- scientific article; zbMATH DE number 3947967
- Multicommodity network flows: A survey. II: Solution methods
- Approximation and Online Algorithms
- scientific article; zbMATH DE number 634022
- A polyhedral approach to an integer multicommodity flow problem
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
- A computationally efficient method for nonlinear multicommodity network flow problems
Cited in
(12)- The flow deviation method: An approach to store‐and‐forward communication network design
- Single-Sink Multicommodity Flow with Side Constraints
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
- scientific article; zbMATH DE number 1990772 (Why is no real title available?)
- Multicommodity flow problems and decomposition in telecommunications networks
- Optimizing flow thinning protection in multicommodity networks with variable link capacity
- A fixed-parameter tractability result for multicommodity demand flow in trees
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
- On methods for the convex multi-commodity flow problem
- \(K\)-splittable delay constrained routing problem: A branch-and-price approach
- Monotonicity and conformality in multicommodity network‐flow problems
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
This page was built for publication: Multicommodity flow problems with a bounded number of paths: A flow deviation approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418124)
