The weighted link ring loading problem

DOI10.1007/S10878-007-9136-7zbMath1175.90070OpenAlexW2072552293MaRDI QIDQ839671

Jinjiang Yuan, Qingqin Nong, Yanpei Liu

Publication date: 2 September 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9136-7

zbMATH Keywords

polynomial-time approximation schemering loading problemweighted load

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (6)

An Improved Upper Bound for the Ring Loading Problem ⋮ A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring ⋮ Online mixed ring covering problem with two nodes ⋮ Computing minimal solutions to the ring loading problem ⋮ A polynomial time approximation scheme for embedding hypergraph in a weighted cycle ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting

Cites Work

• A new polynomial-time algorithm for linear programming
• Multicommodity flows in planar graphs
• Algorithms for routing around a rectangle
• On the ring loading problem with demand splitting.
• Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
• Exact solution of the SONET ring loading problem
• An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
• Edge-disjoint routing in plane switch graphs in linear time
• Optimal Load Balancing on Sonet Bidirectional Rings
• The Ring Loading Problem
• Linear time algorithms for the ring loading problem with demand splitting

This page was built for publication: The weighted link ring loading problem