par Fortz, Bernard ;Labbé, Martine
Référence Mathematical programming, 93, 1, page (27-54)
Publication Publié, 2002-05-08
Article révisé par les pairs
Résumé : 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.

Documents en relation

DI-fusion