论文信息 - SYMMETRIES IN LINEAR AND INTEGER PROGRAMS

SYMMETRIES IN LINEAR AND INTEGER PROGRAMS

The notion of symmetry is dened in the context of Linear and Integer Programming. Symmetric linear and integer programs are studied from a group theoretical viewpoint. We show that for any linear program there exists an optimal solution in the xed point set of its symmetry group. Using this result, we develop an algorithm that allows for reducing the dimension of any linear program having a non-trivial group of symmetries.

R. Bodi | K. Herr | K. Herr | R. Bodi

[1] Jeff T. Linderoth,et al. Orbital Branching , 2007, IPCO.

[2] Sándor P. Fekete,et al. A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing , 2003, Math. Oper. Res..

[3] R. Carter. REFLECTION GROUPS AND COXETER GROUPS (Cambridge Studies in Advanced Mathematics 29) , 1991 .

[4] Eric J. Friedman,et al. Fundamental Domains for Integer Programs with Symmetries , 2007, COCOA.

[5] François Margot,et al. Pruning by isomorphism in branch-and-cut , 2001, Math. Program..

[6] François Margot,et al. Exploiting orbits in symmetric ILP , 2003, Math. Program..

[7] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[8] V. Kaibel,et al. Packing and partitioning orbitopes , 2006, math/0603678.

[9] William C. Waterhouse,et al. Do Symmetric Problems Have Symmetric Solutions , 1983 .