Efficient algorithms for the ring loading problem with demand splitting

DOI10.1007/B13632MaRDI QIDQ5897273zbMATH OpenOpenAlexFDO

Authors Biing-Feng Wang, Yong-Hsian Hsieh, Li-Pu Yeh

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

zbMATH Keywords

algorithmsringsroutingoptical networksdisjoint-set data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Network design and communication in computer systems (68M10)

Recommendations

• Linear time algorithms for the ring loading problem with demand splitting
• On the ring loading problem with demand splitting.
• AN LP-BASED APPROACH TO THE RING LOADING PROBLEM WITH INTEGER DEMAND SPLITTING
• The Ring Loading Problem
• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting

Cited in

(9)

• Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings
• A compact formulation of the ring loading problem with integer demand splitting
• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• Linear time algorithms for the ring loading problem with demand splitting
• On the ring loading problem with demand splitting.
• A decomposition algorithm for the ring spur assignment problem
• Approximation algorithms for the ring loading problem with penalty cost
• An efficient algorithm for the ring loading problem with integer demand splitting
• AN LP-BASED APPROACH TO THE RING LOADING PROBLEM WITH INTEGER DEMAND SPLITTING

This page was built for publication: Efficient algorithms for the ring loading problem with demand splitting

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