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

DOI10.1016/j.orl.2009.01.003zbMath1159.90333OpenAlexW2036940715MaRDI QIDQ1015309

Kyungchul Park, Sungsoo Park, Kyungsik Lee

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)

Related Items (2)

Network design with a discrete set of traffic matrices ⋮ Integral polyhedra related to integer multicommodity flows on a cycle

Cites Work

• Disjunctive programming: Properties of the convex hull of feasible points
• An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Linear time algorithms for the ring loading problem with demand splitting
• Multicommodity Flows in Ring Networks
• Unnamed Item

This page was built for publication: A compact formulation of the ring loading problem with integer demand splitting