Pruning by isomorphism in branch-and-cut

被引：70
|
作者：
Margot, F [1 ]
机构：
[1] Univ Kentucky, Dept Math, Lexington, KY 40506 USA
来源：
MATHEMATICAL PROGRAMMING | 2002年 / 94卷 / 01期
关键词：
branch-and-cut; isomorphism pruning; symmetry;
D O I：
10.1007/s10107-002-0358-2
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating cuts. The cuts are non-standard, cutting integer feasible solutions but leaving the optimal value of the problem unchanged. Pruning and cut generation are performed by backtracking procedures using a Schreier-Sims table for representing the group. Applications to hard set covering problems and to the generation of covering designs and error correcting codes are presented.
引用
收藏
页码：71 / 90
页数：20
相关论文
共 50 条
  • [1] Pruning by isomorphism in branch-and-cut
    François Margot
    Mathematical Programming, 2002, 94 : 71 - 90
  • [2] An Abstract Model for Branch-and-Cut
    Kazachkov, Aleksandr M.
    Le Bodic, Pierre
    Sankaranarayanan, Sriram
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2022, 2022, 13265 : 333 - 346
  • [3] Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression
    Salazar-Gonzalez, Juan-Jose
    PRIVACY IN STATISTICAL DATABASES, 2010, 6344 : 29 - 40
  • [4] Branch-and-cut algorithm for the equicut problem
    Universita degli Studi di Padova, Padova, Italy
    Math Program Ser B, 2 (243-263):
  • [5] Introduction to ABACUS - a branch-and-cut system
    Junger, M
    Thienel, S
    OPERATIONS RESEARCH LETTERS, 1998, 22 (2-3) : 83 - 95
  • [6] A Branch-and-Cut Algorithm for Partition Coloring
    Frota, Yuri
    Maculan, Nelson
    Noronha, Thiago F.
    Ribeiro, Celso C.
    NETWORKS, 2010, 55 (03) : 194 - 204
  • [7] Small covering designs by branch-and-cut
    François Margot
    Mathematical Programming, 2003, 94 : 207 - 220
  • [8] Small covering designs by branch-and-cut
    Margot, F
    MATHEMATICAL PROGRAMMING, 2003, 94 (2-3) : 207 - 220
  • [9] Learning to Configure Separators in Branch-and-Cut
    Li, Sirui
    Ouyang, Wenbin
    Paulus, Max B.
    Wu, Cathy
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [10] A branch-and-cut algorithm for the equicut problem
    Brunetta, L
    Conforti, M
    Rinaldi, G
    MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 243 - 263
12345