The weighted link ring loading problem
From MaRDI portal
Publication:839671
DOI10.1007/S10878-007-9136-7zbMATH Open1175.90070OpenAlexW2072552293MaRDI QIDQ839671FDOQ839671
Authors: Qingqin Nong, Jinjiang Yuan, 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
Recommendations
Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Cites Work
- A new polynomial-time algorithm for linear programming
- Algorithms for routing around a rectangle
- The Ring Loading Problem
- Linear time algorithms for the ring loading problem with demand splitting
- Multicommodity flows in planar graphs
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
- Optimal Load Balancing on Sonet Bidirectional Rings
- On the ring loading problem with demand splitting.
- 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.
Cited In (8)
- A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
- The directed ring loading with penalty cost
- Approximation algorithms for the ring loading problem with penalty cost
- Computing minimal solutions to the ring loading problem
- Online mixed ring covering problem with two nodes
- A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
- An improved upper bound for the ring loading problem
- A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
This page was built for publication: The weighted link ring loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839671)
