Linear optimization over permutation groups

Authors:
Christoph Buchheim;Michael JüNger
Affiliations:
Universität zu Köln, Institut für Informatik, Pohligstr.1, 50969 Köln, Germany;Universität zu Köln, Institut für Informatik, Pohligstr.1, 50969 Köln, Germany
Venue:
Discrete Optimization
Year:
2005

Citing 4
Cited 0

Fast Management of Permutation Groups I

SIAM Journal on Computing
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
Computation with permutation groups

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Polynomial-time algorithms for permutation groups

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a permutation group given by a set of generators, the problem of finding ''special'' group members is NP-hard in many cases, e.g., this is true for the problem of finding a permutation with a minimum number of fixed points or a permutation with a minimal Hamming distance from a given permutation. Many of these problems can be modeled as linear optimization problems over permutation groups. We develop a polyhedral approach to this general problem and derive an exact and practically fast algorithm based on the branch & cut-technique.