The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut
| Autor: | Diarrassouba, Ibrahima, Mahjoub, Meriem, Mahjoub, A. Ridha, Taktak, Raouia |
|---|---|
| Zdroj: | In Electronic Notes in Discrete Mathematics June 2016 52:117-124 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
Full Text from ScienceDirect