Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Mathematical Programming, Series A Année : 2006

Dates et versions

inria-00281574 , version 1 (07-12-2017)

Identifiants

Citer

Bernard Fortz, Ali Ridha Mahjoub, S. T. Mccormick, Pierre Pesneau. Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Mathematical Programming, Series A, 2006, 105, pp.85-111. ⟨10.1007/s10107-005-0576-5⟩. ⟨inria-00281574⟩
141 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More