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

Authors:
Kyungsik Lee;Kyungchul Park;Sungsoo Park
Affiliations:
School of Industrial and Management Engineering, Hankuk University of Foreign Studies, San 89 Yongin-si, Kyunggi-do, 449-791, Republic of Korea;School of Business Administration, Myongji University, 50-3 Namgajwa-dong, Seodaemun-gu, Seoul, 120-728, Republic of Korea;Department of Industrial and Systems Engineering, KAIST, 373-1 Gusong-dong, Yusong-gu, Taejon, 305-701, Republic of Korea
Venue:
Operations Research Letters
Year:
2009

Citing 4
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Disjunctive programming: properties of the convex hull of feasible points

Discrete Applied Mathematics
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting

SIAM Journal on Discrete Mathematics
Linear time algorithms for the ring loading problem with demand splitting

Journal of Algorithms

Communication: Integral polyhedra related to integer multicommodity flows on a cycle

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ring loading problem with integer demand splitting is that of routing @k traffic requirements on an undirected ring network. We present a compact polyhedral description of the set of feasible solutions to the problem, whose number of variables and constraints is O(@k).