Detecting Orbitopal Symmetries
Please always quote using this URN:urn:nbn:de:0296-matheon-5242
- Orbitopes can be used to handle symmetries which arise in integer programming formulations with an inherent assignment structure. We investigate the detection of symmetries appearing in this approach. We show that detecting so-called orbitopal symmetries is graph-isomorphism hard in general, but can be performed in linear time if the assignment structure is known.
Author: | Timo Berthold, Marc E. Pfetsch |
---|---|
URN: | urn:nbn:de:0296-matheon-5242 |
Referee: | Martin Grötschel |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2008/08/21 |
Release Date: | 2008/08/14 |
Tag: | |
Institute: | Zuse Institute Berlin (ZIB) |
MSC-Classification: | 52-XX CONVEX AND DISCRETE GEOMETRY / 52Bxx Polytopes and polyhedra / 52B12 Special polytopes (linear programming, centrally symmetric, etc.) |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming | |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C35 Programming involving graphs or networks [See also 90C27] | |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut | |
Preprint Number: | 516 |