✦ LIBER ✦

The k-edge connected subgraph problem I: Polytopes and critical extreme points

✍ Scribed by M. Didi Biha; A.R. Mahjoub

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Critical extreme points of the 2-edge co

✍ Jean Fonlupt; A. Ridha Mahjoub 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 244 KB

A branch-and-cut algorithm for the k-edg

✍ F. Bendali; I. Diarrassouba; A.R. Mahjoub; M. Didi Biha; J. Mailfert 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB 👁 1 views

[IEEE 2007 6th International Workshop on

✍ Bendali, F.; Diarrassouba, I.; Biha, M. Didi; Mahjoub, A. R.; Mailfert, J. 📂 Article 📅 2007 🏛 IEEE ⚖ 152 KB