On the ring loading problem with demand splitting.
From MaRDI portal
Publication:1417597
DOI10.1016/J.ORL.2003.08.001zbMath1053.90014OpenAlexW2070309420MaRDI QIDQ1417597
Publication date: 5 January 2004
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.08.001
Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)
Related Items (8)
The weighted link ring loading problem ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ Online mixed ring covering problem with two nodes ⋮ Computing minimal solutions to the ring loading problem ⋮ Routing equal-size messages on a slotted ring ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting ⋮ Multicommodity flows in cycle graphs ⋮ Optimal online ring routing
Cites Work
This page was built for publication: On the ring loading problem with demand splitting.