Pruning by isomorphism in branch-and-cut

被引：0
|
作者：
François Margot
机构：
[1] Department of Mathematics,
[2] University of Kentucky,undefined
[3] Lexington,undefined
[4] KY 40506-0027,undefined
[5] e-mail: fmargot@ms.uky.edu,undefined
来源：
Mathematical Programming | 2002年 / 94卷
关键词：
Feasible Solution; Symmetry Group; Integer Linear Program; Enumeration Tree; Large Symmetry;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
 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
页数：19
相关论文
共 50 条
  • [31] A branch-and-cut approach for minimum weight triangulation
    Kyoda, Y
    Imai, K
    Takeuchi, F
    Tajima, A
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 384 - 393
  • [32] A branch-and-cut algorithm for multiple sequence alignment
    Ernst Althaus
    Alberto Caprara
    Hans-Peter Lenhof
    Knut Reinert
    Mathematical Programming, 2006, 105 : 387 - 425
  • [33] 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
  • [34] A branch-and-cut algorithm for the target visitation problem
    Hildenbrandt, Achim
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2019, 7 (03) : 209 - 242
  • [35] Branch-and-cut for complementarity-constrained optimization
    de Farias I.R.
    Jr.
    Kozyreff E.
    Zhao M.
    Mathematical Programming Computation, 2014, 6 (04) : 365 - 403
  • [36] 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
  • [37] Branch-and-cut approaches for p-Cluster Editing
    Bulhoes, Teobaldo
    de Sousa Filho, Gilberto F.
    Subramanian, Anand
    Cabral, Lucidio dos Anjos F.
    DISCRETE APPLIED MATHEMATICS, 2017, 219 : 51 - 64
  • [38] 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
  • [39] A branch-and-cut algorithm for capacitated network design problems
    Oktay Günlük
    Mathematical Programming, 1999, 86 : 17 - 39
  • [40] 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
12345