1084 eng reportzib 0 2008-08-14 2008-08-14 -- 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. 08-33 1438-0064 1119 urn:nbn:de:0297-zib-10842 Appeared in: Operations Research Proceedings 2008, Bernhard Fleischmann ... (eds.), 2009, pp. 433-438 Timo Berthold unknown unknown Marc Pfetsch 08-33 deu uncontrolled Symmetrie-Erkennung deu uncontrolled Orbitope deu uncontrolled Ganzzahlige Programmierung deu uncontrolled Symmetrie-Brechung deu uncontrolled Graphenisomorphie eng uncontrolled symmetry detection eng uncontrolled orbitopes eng uncontrolled integer programming eng uncontrolled symmetry breaking eng uncontrolled graph ismorphism Mathematik Special polytopes (linear programming, centrally symmetric, etc.) Integer programming Programming involving graphs or networks [See also 90C27] Polyhedral combinatorics, branch-and-bound, branch-and-cut Mathematical Optimization Berthold, Timo MATHEON-B12:IPSym Applied Optimization https://opus4.kobv.de/opus4-zib/files/1084/ZR_08_33.pdf https://opus4.kobv.de/opus4-zib/files/1084/ZR_08_33.ps