Detecting Orbitopal Symmetries

Please always quote using this URN: urn:nbn:de:0297-zib-10842

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.

Metadaten
Author:	Timo Berthold ORCiD, Marc Pfetsch ORCiD
Document Type:	ZIB-Report
Tag:	Ganzzahlige Programmierung; Graphenisomorphie; Orbitope; Symmetrie-Brechung; Symmetrie-Erkennung graph ismorphism; integer programming; orbitopes; symmetry breaking; symmetry detection
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
Date of first Publication:	2008/08/14
Series (Serial Number):	ZIB-Report (08-33)
ISSN:	1438-0064
ZIB-Reportnumber:	08-33
Published in:	Appeared in: Operations Research Proceedings 2008, Bernhard Fleischmann ... (eds.), 2009, pp. 433-438

Open Access