Automatic Generation of Symmetry-Breaking Constraints
暂无分享,去创建一个
[1] François Margot,et al. Small covering designs by branch-and-cut , 2003, Math. Program..
[2] François Margot,et al. On a Binary-Encoded ILP Coloring Formulation , 2007, INFORMS J. Comput..
[3] Peter van Beek,et al. Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.
[4] Marc Boulle,et al. Compact Mathematical Formulation for Graph Partitioning , 2004 .
[5] François Margot,et al. Pruning by isomorphism in branch-and-cut , 2001, Math. Program..
[6] Jon Lee. All-Different Polytopes , 2002, J. Comb. Optim..
[7] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[8] Thorsten Koch,et al. Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .
[9] François Margot,et al. Symmetric ILP: Coloring and small integers , 2007, Discret. Optim..
[10] David E. Bell. Constructive Group Relaxations for Integer Programs , 1976 .
[11] V. Kaibel,et al. Packing and partitioning orbitopes , 2006, math/0603678.
[12] Peter Jeavons,et al. Symmetry Definitions for Constraint Satisfaction Problems , 2005, Constraints.
[13] Leo Liberti,et al. Reformulation techniques in mathematical programming , 2009, Discret. Appl. Math..
[14] Eric J. Friedman,et al. Fundamental Domains for Integer Programs with Symmetries , 2007, COCOA.
[15] Hanif D. Sherali,et al. Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..
[16] Leo Liberti. Reformulations in Mathematical Programming: Definitions , 2008, CTW.
[17] François Margot,et al. Exploiting orbits in symmetric ILP , 2003, Math. Program..