• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Mathematical formulations for the Balanced Vertex k-Separator Problem

Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, Ali Ridha; Martin, Sébastien (2014), Mathematical formulations for the Balanced Vertex k-Separator Problem, 2014 International Conference on Control, Decision and Information Technologies (CoDIT), IEEE : Piscataway, NJ, p. 176-181. 10.1109/CoDIT.2014.6996889

Type
Communication / Conférence
Date
2014
Book title
2014 International Conference on Control, Decision and Information Technologies (CoDIT)
Publisher
IEEE
Published in
Piscataway, NJ
ISBN
978-1-4799-6773-5
Pages
176-181
Publication identifier
10.1109/CoDIT.2014.6996889
Metadata
Show full item record
Author(s)
Cornaz, Denis
Furini, Fabio
Lacroix, Mathieu cc
Malaguti, Enrico
Mahjoub, Ali Ridha
Martin, Sébastien cc
Abstract (EN)
Given an indirected graph G = (V;E), a Vertex k-Separator is a subset of the vertex set V such that, when the separator is removed from the graph, the remaining vertices can be partitioned into k subsets that are pairwise edge-disconnected. In this paper we focus on the Balanced Vertex k-Separator Problem, i.e., the problem of finding a minimum cardinality separator such that the sizes of the resulting disconnected subsets are balanced. We present a compact Integer Linear Programming formulation for the problem, and present a polyhedral study of the associated polytope. We also present an Exponential-Size formulation, for which we derive a column generation and a branching scheme. Preliminary computational results are reported comparing the performance of the two formulations on a set of benchmark instances.
Subjects / Keywords
graph theory

Related items

Showing items related by title and author.

  • Thumbnail
    The vertex k-cut problem 
    Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, Ali Ridha; Martin, Sébastien (2019) Article accepté pour publication ou publié
  • Thumbnail
    The vertex k-cut problem 
    Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, Ali Ridha; Martin, Sébastien (2019) Article accepté pour publication ou publié
  • Thumbnail
    The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut 
    Cornaz, Denis; Magnouche, Youcef; Mahjoub, Ali Ridha; Martin, Sébastien (2019) Article accepté pour publication ou publié
  • Thumbnail
    The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut 
    Cornaz, Denis; Magnouche, Youcef; Mahjoub, Ali Ridha; Martin, Sébastien (2015) Communication / Conférence
  • Thumbnail
    On integer and bilevel formulations for the k-vertex cut problem 
    Furini, Fabio; Ljubić, Ivana; Malaguti, Enrico; Paronuzzi, Paolo (2020) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo