DMCA
Determining the Automorphism Group of the Linear Ordering Polytope (1999)
| Venue: | DISCRETE APPLIED MATHEMATICS |
| Citations: | 8 - 4 self |
BibTeX
@ARTICLE{Fiorini99determiningthe,
author = {Samuel Fiorini},
title = {Determining the Automorphism Group of the Linear Ordering Polytope},
journal = {DISCRETE APPLIED MATHEMATICS},
year = {1999},
volume = {112},
pages = {121--128}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we explore the combinatorial automorphism group of the linear ordering polytope P n LO for each n ? 1. We establish that this group is isomorphic to Z 2 \Theta Sym(n + 1) if n ? 2 (and to Z 2 if n = 2). Doing so, we provide a simple and unified interpretation of all the automorphisms.
Keyphrases
automorphism group linear ordering polytope input-output table linear program advanced technique base set hard combinatorial optimization problem facial structure efficient algorithm linear programming combinatorial automorphism group unified interpretation key word triangulation problem familiar object linear order polyhedral combinatorics theta sym total order real-world instance convex hull
