A compact formulation of the ring loading problem with integer demand splitting

DOI10.1016/J.ORL.2009.01.003MaRDI QIDQ1015309zbMATH OpenOpenAlexFDO

Authors Kyungsik Lee, Kyungchul Park, Sungsoo Park

Publication date 7 May 2009

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2009.01.003

zbMATH Keywords

convex hullring loading problemmulticommodity integral flows

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Recommendations

• AN LP-BASED APPROACH TO THE RING LOADING PROBLEM WITH INTEGER DEMAND SPLITTING
• On the ring loading problem with demand splitting.
• Efficient algorithms for the ring loading problem with demand splitting
• An improved upper bound for the ring loading problem
• A note on the ring loading problem

Cites work

• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• An efficient algorithm for the ring loading problem with integer demand splitting
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Disjunctive programming: Properties of the convex hull of feasible points
• Linear time algorithms for the ring loading problem with demand splitting
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Multicommodity Flows in Ring Networks

Cited in

(5)

• Integral polyhedra related to integer multicommodity flows on a cycle
• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• A decomposition algorithm for the ring spur assignment problem
• Network design with a discrete set of traffic matrices
• AN LP-BASED APPROACH TO THE RING LOADING PROBLEM WITH INTEGER DEMAND SPLITTING

This page was built for publication: A compact formulation of 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 Q1015309)