Single-Sink Multicommodity Flow with Side Constraints
From MaRDI portal
Publication:2971620
DOI10.1007/978-3-540-76796-1_20zbMath1359.90019OpenAlexW1205736921MaRDI QIDQ2971620
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_20
Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)
Related Items (3)
An Improved Upper Bound for the Ring Loading Problem ⋮ Rerouting Flows when Links Fail ⋮ A Note on the Ring Loading Problem
Cites Work
- Better alternatives to OSPF routing
- On the single-source unsplittable flow problem
- Optimal wavelength-routed multicasting
- Approximating the single source unsplittable min-cost flow problem
- Graph minors. XIII: The disjoint paths problem
- The geometry of graphs and some of its algorithmic applications
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Reserving Resilient Capacity in a Network
- On multiroute maximum flows in networks
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Maximal Flow Through a Network
- Degree-constrained network flows
- The all-or-nothing multicommodity flow problem
- (Almost) tight bounds and existence theorems for confluent flows
- Meet and merge
- Cyclic Scheduling via Integer Programs with Circular Ones
- The Ring Loading Problem
- Network information flow
- Reserving resilient capacity for a single commodity with upper-bound constraints
- Edge-Disjoint Paths in Planar Graphs with Constant Congestion
- Algorithms – ESA 2004
- Strong inequalities for capacitated survivable network design problems.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Single-Sink Multicommodity Flow with Side Constraints
