The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut

In this paper we consider the k-edge connected subgraph problem from a polyhedral point of view. We introduce further classes of valid inequalities for the associated polytope, and describe sufficient conditions for these inequalities to be facet defining. We also devise separation routines for these inequalities, and discuss some reduction operations that can be used in a preprocessing phase for the separation. Using these results, we develop a Branch-and-Cut algorithm and present some computational results.

Mots clés

Branch-and-Cut k-edge connected subgraph polytope facet separation reduction operations Branch-and-Cut.

Domaines

Recherche opérationnelle [math.OC]

Fichier principal

RR-07-01b.pdf (193.71 Ko)

Origine	Fichiers produits par l'(les) auteur(s)

Bastien DOREAU : Connectez-vous pour contacter le contributeur

https://hal.science/hal-00678058

Soumis le : lundi 12 mars 2012-09:53:35

Dernière modification le : mardi 18 avril 2023-10:00:05

Archivage à long terme le : mercredi 14 décembre 2016-11:46:00

Dates et versions

hal-00678058 , version 1 (12-03-2012)

Identifiants

HAL Id : hal-00678058 , version 1
DOI : 10.1109/DRCN.2007.4762290

Citer

Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert. The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. International Workshop on Design of Reliable Communication Networks (DRCN), Oct 2007, La Rochelle, France. pp.Pages 1 - 8, ⟨10.1109/DRCN.2007.4762290⟩. ⟨hal-00678058⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

PRES_CLERMONT CNRS LIMOS CLERMONT-AUVERGNE-INP

127 Consultations

370 Téléchargements