A note on the problem of r disjoint (s,t)-cuts and some related issues

Walid Ben-Ameur (1, 2, 3, 4) , Mohamed Didi Biha (5)

1 METHODES-SAMOVAR - Méthodes et modèles pour les réseaux
2 TSP - RS2M - Département Réseaux et Services Multimédia Mobiles
3 SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
4 CNRS - Centre National de la Recherche Scientifique
5 LMNO - Laboratoire de Mathématiques Nicolas Oresme

In this paper we consider the problem of finding a minimum-cost set of r disjoint (s, t)-cuts. We establish the link between this problem and some of its variations. We give a full description of the dominant of the convex hull of the incidence vectors of sets of r disjoint (s, t)-cuts. This generalizes the well-known result for the r = 1 case

Mots clés: Graph partitioning; Cut; Polyhedra

Domaines: Mathématique discrète [cs.DM]; Recherche opérationnelle [math.OC]; Optimisation et contrôle [math.OC]

Walid Ben-Ameur, Mohamed Didi Biha. A note on the problem of r disjoint (s,t)-cuts and some related issues. Operations Research Letters, 2018, 46, pp.335 - 338. ⟨10.1016/j.orl.2018.03.003⟩. ⟨hal-01783782⟩