An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
From MaRDI portal
Publication:2719172
DOI10.1137/S0895480199358709zbMath0980.90016OpenAlexW2022446631MaRDI QIDQ2719172
Publication date: 21 June 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480199358709
Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (12)
The weighted link ring loading problem ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ Models and complexity of multibin packing problems ⋮ On the ring loading problem with demand splitting. ⋮ Network design with a discrete set of traffic matrices ⋮ Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem ⋮ Integral polyhedra related to integer multicommodity flows on a cycle ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting ⋮ Multicommodity flows in cycle graphs ⋮ Optimal online ring routing ⋮ A compact formulation of the ring loading problem with integer demand splitting ⋮ Approximation algorithms for the ring loading problem with penalty cost
Uses Software
This page was built for publication: An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
