A branch-and-cut algorithm for the maximum cardinality stable set problem

被引：35
|
作者：
Rossi, F [1 ]
Smriglio, S [1 ]
机构：
[1] Univ Aquila, Dipartimento Matemat Pura & Applicata, I-67010 Coppito, Laquila, Italy
来源：
OPERATIONS RESEARCH LETTERS | 2001年 / 28卷 / 02期
关键词：
branch-and-cut; stable set; rank inequality;
D O I：
10.1016/S0167-6377(00)00060-2
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We propose a branch-and-cut algorithm fur the Maximum Cardinality Stable Set problem. Rank constraints of general structure are generated by executing clique separation algorithms on a modified graph obtained with edge projections. A branching scheme exploiting the available inequalities is also introduced. A computational experience on the DIMACS benchmark graphs validates the effectiveness of the approach. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：63 / 74
页数：12
相关论文
共 50 条
  • [41] A branch-and-cut algorithm for the hub location and routing problem
    Rodriguez-Martin, Inmaculada
    Salazar-Gonzalez, Juan-Jose
    Yaman, Hande
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 50 : 161 - 174
  • [42] A Branch-and-Cut algorithm for factory crane scheduling problem
    Xu Cheng
    Lixin Tang
    Panos M. Pardalos
    [J]. Journal of Global Optimization, 2015, 63 : 729 - 755
  • [43] A branch-and-cut algorithm for the Steiner tree problem with delays
    V. Leggieri
    M. Haouari
    C. Triki
    [J]. Optimization Letters, 2012, 6 : 1753 - 1771
  • [44] A branch-and-cut algorithm for the balanced traveling salesman problem
    Thi Quynh Trang Vo
    Mourad Baiou
    Viet Hung Nguyen
    [J]. Journal of Combinatorial Optimization, 2024, 47
  • [45] A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
    Silvestri, Selene
    Laporte, Gilbert
    Cerulli, Raffaele
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 81 : 322 - 332
  • [46] A branch-and-cut algorithm for a realistic dial-a-ride problem
    Liu, Mengyang
    Luo, Zhixing
    Lim, Andrew
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 81 : 267 - 288
  • [47] A branch-and-cut algorithm for the profitable windy rural postman problem
    Avila, Thais
    Corberan, Angel
    Plana, Isaac
    Sanchis, Jose M.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (03) : 1092 - 1101
  • [48] A Branch-and-Cut Algorithm for the Inventory Routing Problem with Product Substitution
    Mahmutogullari, Ozlem
    Yaman, Hande
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2023, 115
  • [49] A branch-and-cut algorithm for a resource-constrained scheduling problem
    Sirdey, Renaud
    Kerivin, Herve L. M.
    [J]. RAIRO-OPERATIONS RESEARCH, 2007, 41 (03) : 235 - 251
  • [50] A branch-and-cut algorithm for the discrete (r|p)-centroid problem
    Roboredo, Marcos Costa
    Pessoa, Artur Alves
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 224 (01) : 101 - 109
12345