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 条
  • [31] A branch-and-cut algorithm for the undirected traveling purchaser problem
    Laporte, G
    Riera-Ledesma, J
    Salazar-González, JJ
    OPERATIONS RESEARCH, 2003, 51 (06) : 940 - 951
  • [32] A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
    Ghaddar, Bissan
    Anjos, Miguel F.
    Liers, Frauke
    ANNALS OF OPERATIONS RESEARCH, 2011, 188 (01) : 155 - 174
  • [33] A branch-and-cut algorithm for the maximum covering cycle problem
    Alvarez-Miranda, Eduardo
    Sinnl, Markus
    ANNALS OF OPERATIONS RESEARCH, 2020, 284 (02) : 487 - 499
  • [34] A branch-and-cut algorithm for the Undirected Rural Postman Problem
    Ghiani, G
    Laporte, G
    MATHEMATICAL PROGRAMMING, 2000, 87 (03) : 467 - 481
  • [35] A branch-and-cut algorithm for the maximum covering cycle problem
    Eduardo Álvarez-Miranda
    Markus Sinnl
    Annals of Operations Research, 2020, 284 : 487 - 499
  • [36] A branch-and-cut framework for the consistent traveling salesman problem
    Subramanyam, Anirudh
    Gounaris, Chrysanthos E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 248 (02) : 384 - 395
  • [37] A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
    Bissan Ghaddar
    Miguel F. Anjos
    Frauke Liers
    Annals of Operations Research, 2011, 188 : 155 - 174
  • [38] A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
    Silvestri, Selene
    Laporte, Gilbert
    Cerulli, Raffaele
    COMPUTERS & OPERATIONS RESEARCH, 2017, 81 : 322 - 332
  • [39] A branch-and-cut algorithm for the balanced traveling salesman problem
    Vo, Thi Quynh Trang
    Baiou, Mourad
    Nguyen, Viet Hung
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (02)
  • [40] A branch-and-cut algorithm for the capacitated profitable tour problem
    Jepsen, Mads Kehlet
    Petersen, Bjorn
    Spoorendonk, Simon
    Pisinger, David
    DISCRETE OPTIMIZATION, 2014, 14 : 78 - 96
12345