The k-node-connected subgraph problem: Facets and Branch-and-Cut - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub. The k-node-connected subgraph problem: Facets and Branch-and-Cut. In Prosper Chemouil, Achille Pattavina, Éric Gourdin, Stefano Secci, editors, 12th International Conference on the Design of Reliable Communication Networks, DRCN 2016, Paris, France, March 15-17, 2016. pages 1-8, IEEE, 2016. [doi]

This author has not been identified. Look up 'Ibrahima Diarrassouba' in GoogleThis author has not been identified. Look up 'Meriem Mahjoub' in GoogleThis author has not been identified. Look up 'Ali Ridha Mahjoub' in Google

runs on WebDSL