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 条
  • [21] A branch-and-cut algorithm for the Edge Interdiction Clique Problem
    Furini, Fabio
    Ljubic, Ivana
    San Segundo, Pablo
    Zhao, Yanlu
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 294 (01) : 54 - 69
  • [22] A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem
    Fernandez, Elena
    Laporte, Gilbert
    Rodriguez-Pereira, Jessica
    [J]. TRANSPORTATION SCIENCE, 2018, 52 (02) : 353 - 369
  • [23] A branch-and-cut algorithm for the routing and spectrum allocation problem
    Bianchetti, Marcelo
    Marenco, Javier
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 339 : 107 - 126
  • [24] A branch-and-cut algorithm for the undirected traveling purchaser problem
    Laporte, G
    Riera-Ledesma, J
    Salazar-González, JJ
    [J]. OPERATIONS RESEARCH, 2003, 51 (06) : 940 - 951
  • [25] A branch-and-cut algorithm for the Undirected Rural Postman Problem
    Ghiani, G
    Laporte, G
    [J]. MATHEMATICAL PROGRAMMING, 2000, 87 (03) : 467 - 481
  • [26] The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
    Simonetti, Luidi
    da Cunha, Alexandre Salles
    Lucena, Abilio
    [J]. NETWORK OPTIMIZATION, 2011, 6701 : 162 - 169
  • [27] A branch-and-cut algorithm for the restricted Block Relocation Problem
    Bacci, Tiziano
    Mattia, Sara
    Ventura, Paolo
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 287 (02) : 452 - 459
  • [28] A branch-and-cut algorithm for the dial-a-ride problem
    Cordeau, Jean-Francois
    [J]. OPERATIONS RESEARCH, 2006, 54 (03) : 573 - 586
  • [29] The pickup and delivery problem: Faces and branch-and-cut algorithm
    Ruland, KS
    Rodin, EY
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1997, 33 (12) : 1 - 13
  • [30] A branch-and-cut algorithm for the Undirected Rural Postman Problem
    Gianpaolo Ghiani
    Gilbert Laporte
    [J]. Mathematical Programming, 2000, 87 : 467 - 481
12345