Abstract.
We study the polyhedron associated with a network design problem which consists in determining at minimum cost a two-connected network such that the shortest cycle to which each edge belongs (a “ring”) does not exceed a given length K.¶We present here a new formulation of the problem and derive facet results for different classes of valid inequalities. We study the separation problems associated to these inequalities and their integration in a Branch-and-Cut algorithm, and provide extensive computational results.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: September 1999 / Accepted: February 2002¶Published online May 8, 2002
Rights and permissions
About this article
Cite this article
Fortz, B., Labbé, M. Polyhedral results for two-connected networks with bounded rings. Math. Program. 93, 27–54 (2002). https://doi.org/10.1007/s10107-002-0299-9
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0299-9