- Full text PDF available (7)
This paper considers the polyhedral structure of the precedence-constrained knapsack problem, which is a knapsack problem with precedence constraints imposed on the set of variables. The problem itself appears in many applications. Moreover, since the precedence constraints appear in many important integer programming problems, the polyhedral results can be… (More)
We consider the problem of designing a local network in a two-level telecommunication network. Given one or two hub nodes, central offices (COs) and conduits, the problem is to find a set of unidirectional self-healing rings (USHRs) which covers all COs and satisfies all demands at minimum cost. The solution approach used is the decomposition and column… (More)
— We consider the multicast routing and wavelength assignment (MC-RWA) problem on WDM bidirectional ring networks without wavelength conversion. We give an integer programming formulation of the problem and propose an algorithm to solve it optimally. The algorithm is based on column generation and branch-and-price. We test the proposed algorithm on randomly… (More)
We consider the Ring Loading Problem with integer demand splitting (RLP). The problem is given with a ring network, in which a required traffic requirement between each selected node pair must be routed on it. Each traffic requirement can be routed in both directions of the ring network while splitting each traffic requirement in two directions only by… (More)
Keywords: Multicommodity integral flows Ring loading problem Convex hull a b s t r a c t The ring loading problem with integer demand splitting is that of routing κ 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(κ).