Detecting symmetries by branch and cut.

DOI10.1007/S10107-003-0409-3zbMath1127.68407OpenAlexW1994694926MaRDI QIDQ1424304

Christoph Buchheim, Michael Jünger

Publication date: 11 March 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0409-3

zbMATH Keywords

algorithminteger programmingsymmetriesautomatic graph drawingasymmetric traveling salesman polytopebranch \& cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Linear optimization over permutation groups

Uses Software

• Unnamed Item

This page was built for publication: Detecting symmetries by branch and cut.