The k-node-connected subgraph problem: Facets and Branch-and-Cut

被引：0
|
作者：
Diarrassouba, Ibrahima [1 ]
Mahjoub, Meriem [2 ]
Mahjoub, A. Ridha [2 ]
机构：
[1] Univ Havre, LMAH, Le Havre, France
[2] Univ Paris 09, LAMSADE, Paris, France
来源：
PROCEEDINGS OF THE 2016 12TH INTERNATIONAL CONFERENCE ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS (DRCN 2016) | 2016年
关键词：
DESIGNING COMMUNICATION-NETWORKS; POLYHEDRA;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
In this paper we consider the k-node-connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We introduce further classes of valid inequalities and discuss their facial aspect. We also devise separation routines and discuss some structure properties and reduction operations. Using these results, we devise a Branch-and-Cut algorithm along with some computational results.
引用
收藏
页码：1 / 8
页数：8
相关论文
共 50 条
  • [1] The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut
    Mahjoub, Meriem
    Diarrassouba, I.
    Mahjoub, A. R.
    Taktak, R.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 112 : 690 - 705
  • [2] A Branch-and-Cut Algorithm for the k-Edge Connected Subgraph Problem
    Bendali, F.
    Diarrassouba, I.
    Mahjoub, A. R.
    Biha, M. Didi
    Mailfert, J.
    NETWORKS, 2010, 55 (01) : 13 - 32
  • [3] The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut
    Bendali, F.
    Diarrassouba, I.
    Biha, M. Didi
    Mahjoub, A. R.
    Mailfert, J.
    DRCN: 2007 6TH INTERNATIONAL WORKSHOP ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS, 2007, : 281 - +
  • [4] A branch-and-cut algorithm for the connected max- k-cut problem
    Healy, Patrick
    Jozefowiez, Nicolas
    Laroche, Pierre
    Marchetti, Franc
    Martin, Sebastien
    Roka, Zsuzsanna
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 312 (01) : 117 - 124
  • [5] New facets and a branch-and-cut algorithm for the weighted clique problem
    Sorensen, MA
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 154 (01) : 57 - 70
  • [6] The K-partitioning problem: Formulations and branch-and-cut
    Ales, Zacharie
    Knippel, Arnaud
    NETWORKS, 2020, 76 (03) : 323 - 349
  • [7] A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph
    Figueiredo, Rosa
    Frota, Yuri
    Labbe, Martine
    DISCRETE APPLIED MATHEMATICS, 2019, 261 : 164 - 185
  • [8] Branch-and-cut algorithm for the equicut problem
    Universita degli Studi di Padova, Padova, Italy
    Math Program Ser B, 2 (243-263):
  • [9] A branch-and-cut algorithm for the equicut problem
    Brunetta, L
    Conforti, M
    Rinaldi, G
    MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 243 - 263
  • [10] A branch-and-cut algorithm for the equicut problem
    Lorenzo Brunetta
    Michele Conforti
    Giovanni Rinaldi
    Mathematical Programming, 1997, 78 : 243 - 263
12345