Designing Private Line Networks

We study a capacitated network design problem arising in the design of private line networks. Given a complete graph, a subset of its node set (the "hub"set), and point-to-point traffic demands, the objective is to install capacity on the edges (using several batch sizes and nonlinear costs), and route traffic in the resulting capacitated network, so that 1) all the demand between a pair of nodes is routed along a single path, and 2) the demand is either sent directly from source to sink, or via a number of hub nodes. We first formulate an initial integer program, and various approximations to it. Valid inequalities are then derived for a special knapsack problem involving both integer and 0-1 variables arising from the capacity constraints on an edge. These and related inequalities are then used to strengthen the formulations. Computational results using these inequalities within a general purpose branch-and-cut system are presented.

By: Oktay Gunluk, Beate Brockmuller, Lawrence Wolsey

Published in: RC22808 in 2003


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .