The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | Design and Reliable Communication Networks, 2007. DRCN 2007. 6th International Workshop on |
| Author | Bendali, Fatiha, Diarrassouba, Ibrahima, Didi Biha, Mohamed, Mahjoub, Ali Ridha, Mailfert, Jean |
| Maintainer | CCSD |
| Last Updated | May 25, 2026, 03:55 (UTC) |
| Created | May 25, 2026, 03:55 (UTC) |
| Identifier | hal-00678058 |
| Language | en |
| Rights | https://about.hal.science/hal-authorisation-v1/ |
| contributor | Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS) ; Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS) |
| coverage | La Rochelle, France |
| creator | Bendali, Fatiha |
| date | 2007-10-07T00:00:00 |
| harvest_object_id | 2cec0dff-f608-4cbc-9626-5f9c7b1b0449 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-08-12T00:00:00 |
| relation | info:eu-repo/semantics/altIdentifier/doi/10.1109/DRCN.2007.4762290 |
| set_spec | type:COMM |