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 条
  • [21] A branch-and-cut algorithm for the pallet loading problem
    Alvarez-Valdes, R
    Parreño, F
    Tamarit, JM
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (11) : 3007 - 3029
  • [22] A Branch-and-Cut Algorithm for the Nonpreemptive Swapping Problem
    Bordenave, Charles
    Gendreau, Michel
    Laporte, Gilbert
    NAVAL RESEARCH LOGISTICS, 2009, 56 (05) : 478 - 486
  • [23] Branch-and-cut for the maximum feasible subsystem problem
    Pfetsch, Marc E.
    SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (01) : 21 - 38
  • [24] A branch-and-cut algorithm for the Team Orienteering Problem
    Bianchessi, Nicola
    Mansini, Renata
    Speranza, M. Grazia
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (02) : 627 - 635
  • [25] A branch-and-cut algorithm for the target visitation problem
    Hildenbrandt, Achim
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2019, 7 (03) : 209 - 242
  • [26] Polyhedral results and a Branch-and-cut algorithm for the k-cardinality tree problem
    Simonetti, Luidi
    da Cunha, Alexandre Salles
    Lucena, Abilio
    MATHEMATICAL PROGRAMMING, 2013, 142 (1-2) : 511 - 538
  • [27] A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem
    Fernandez, Elena
    Laporte, Gilbert
    Rodriguez-Pereira, Jessica
    TRANSPORTATION SCIENCE, 2018, 52 (02) : 353 - 369
  • [28] BRANCH-AND-CUT APPROACH TO A VARIANT OF THE TRAVELING SALESMAN PROBLEM
    PADBERG, M
    RINALDI, G
    JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 1988, 11 (05) : 436 - 440
  • [29] A branch-and-cut algorithm for the Edge Interdiction Clique Problem
    Furini, Fabio
    Ljubic, Ivana
    San Segundo, Pablo
    Zhao, Yanlu
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 294 (01) : 54 - 69
  • [30] A branch-and-cut algorithm for the routing and spectrum allocation problem
    Bianchetti, Marcelo
    Marenco, Javier
    DISCRETE APPLIED MATHEMATICS, 2023, 339 : 107 - 126
12345