Skip to main content
Article thumbnail
Location of Repository

Capacitated network design using general flow-cutset inequalities

By Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski and Roland Wessäly

Abstract

This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flow-cutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib), we show that the performance of Cplex can significantly be enhanced by this class of cutting planes. The computations reveal the particular importance of the subclass of cutset inequalities

Topics: general flow-cutset inequalities, capacitated network design, mixed integer rounding, SNDlib
Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.180.4545
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.optimization-online... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.