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 条
  • [21] A branch-and-cut algorithm for the preemptive swapping problem
    Bordenave, Charles
    Gendreau, Michel
    Laporte, Gilbert
    NETWORKS, 2012, 59 (04) : 387 - 399
  • [22] A branch-and-cut approach to the crossing number problem
    Buchheim, Christoph
    Chimani, Markus
    Ebner, Dietmar
    Gutwenger, Carsten
    Juenger, Michael
    Klau, Gunnar W.
    Mutzel, Petra
    Weiskircher, Rene
    DISCRETE OPTIMIZATION, 2008, 5 (02) : 373 - 388
  • [23] A polyhedral branch-and-cut approach to global optimization
    Tawarmalani, M
    Sahinidis, NV
    MATHEMATICAL PROGRAMMING, 2005, 103 (02) : 225 - 249
  • [24] A polyhedral branch-and-cut approach to global optimization
    Mohit Tawarmalani
    Nikolaos V. Sahinidis
    Mathematical Programming, 2005, 103 : 225 - 249
  • [25] A Branch-and-Cut Algorithm for Submodular Interdiction Games
    Taninmis, Kubra
    Sinnl, Markus
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (05) : 2634 - 2657
  • [26] Declawing a graph: polyhedra and Branch-and-Cut algorithms
    Fragoso, Felipe C.
    de Sousa Filho, Gilberto F.
    Protti, Fabio
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 42 (01) : 85 - 124
  • [27] A Parallel Branch-and-Cut Approach for Detailed Placement
    Cauley, Stephen
    Balakrishnan, Venkataramanan
    Hu, Y. Charlie
    Koh, Cheng-Kok
    ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2011, 16 (02)
  • [28] 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
  • [29] A Branch-and-Cut Algorithm for the Nonpreemptive Swapping Problem
    Bordenave, Charles
    Gendreau, Michel
    Laporte, Gilbert
    NAVAL RESEARCH LOGISTICS, 2009, 56 (05) : 478 - 486
  • [30] Branch-and-cut for the maximum feasible subsystem problem
    Pfetsch, Marc E.
    SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (01) : 21 - 38
12345