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

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.