A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting

DOI10.1016/J.TCS.2010.04.035zbMATH Open1192.68834OpenAlexW2089110625MaRDI QIDQ982669FDOQ982669

Authors: J. Martínez 

Publication date: 7 July 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.035

Recommendations

• An efficient algorithm for the ring loading problem with integer demand splitting
• Linear time algorithms for the ring loading problem with demand splitting
• Efficient algorithms for the ring loading problem with demand splitting
• AN LP-BASED APPROACH TO THE RING LOADING PROBLEM WITH INTEGER DEMAND SPLITTING
• A compact formulation of the ring loading problem with integer demand splitting
• On the ring loading problem with demand splitting.
• Approximation algorithms for the ring loading problem with penalty cost

zbMATH Keywords

polynomial-time algorithmring loading problemweighted load

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• 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
• The weighted link ring loading problem
• 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)

• Linear time algorithms for the ring loading problem with demand splitting
• Efficient algorithms for the ring loading problem with demand splitting
• A decomposition algorithm for the ring spur assignment problem
• An efficient algorithm for the ring loading problem with integer demand splitting
• Online mixed ring covering problem with two nodes
• The weighted link ring loading problem
• An improved upper bound for the ring loading problem
• A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring

Uses Software

• SONET

This page was built for publication: A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q982669)