Optimization Online


Partition Inequalities for Capacitated Survivable Network Design Based on Directed P-Cycles

Alper Atamturk (atamturk***at***berkeley.edu)
Deepak Rajan (drajan***at***us.ibm.com)

Abstract: We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failures. Survivability of the network is accomplished by reserving sufficient slack on directed p-cycles so that if an edge fails, its flow can be rerouted along the p-cycles. pwd We describe a model for designing capacitated survivable networks based on directed p-cycles. We motivate this model by comparing it with other means of ensuring survivability, and present a mixed-integer programming formulation for it. We derive valid inequalities for the model based on the minimum capacity requirement between partitions of the nodes and give facet conditions for them. We discuss the separation for these inequalities and present results of computational experiments for testing their effectiveness as cutting planes when incorporated in a branch-and-cut algorithm. Our experiments show that the proposed inequalities reduce the computational effort significantly.


Category 1: Applications -- OR and Management Sciences

Category 2: Applications -- OR and Management Sciences (Telecommunications )

Citation: Discrete Optimization 5, 415-433, 2008


Entry Submitted: 06/26/2007
Entry Accepted: 06/29/2007
Entry Last Modified: 04/15/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society