AN LP-BASED APPROACH TO THE RING LOADING PROBLEM WITH INTEGER DEMAND SPLITTING

DOI10.15807/JORSJ.52.35zbMATH Open1177.90058OpenAlexW1498094315MaRDI QIDQ3635901FDOQ3635901

Authors: Kyungchul Park, Kyungsik Lee, Sungsoo Park 

Publication date: 6 July 2009

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.52.35

Recommendations

• Efficient algorithms for the ring loading problem with demand splitting
• On the ring loading problem with demand splitting.
• Linear time algorithms for the ring loading problem with demand splitting
• A compact formulation of the ring loading problem with integer demand splitting
• An improved upper bound for the ring loading problem

zbMATH Keywords

integer programmingnetwork flowdiscrete optimizationring loading

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10)

Cited In (5)

• A compact formulation of the ring loading problem with integer demand splitting
• Linear time algorithms for the ring loading problem with demand splitting
• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• Efficient algorithms for the ring loading problem with demand splitting
• An improved upper bound for the ring loading problem

This page was built for publication: AN LP-BASED APPROACH TO THE 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 Q3635901)