Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut - Archive ouverte HAL Access content directly
Journal Articles Mathematical Programming, Series A Year : 2006

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut

(1) , (2) , (3) , (2, 4, 5)
1
2
3
4
5

Dates and versions

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

Identifiers

Cite

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⟩
140 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More