Determining the automorphism group of the linear ordering polytope
From MaRDI portal
Publication:5946819
DOI10.1016/S0166-218X(00)00312-7zbMath1006.20002WikidataQ126422068 ScholiaQ126422068MaRDI QIDQ5946819
Publication date: 30 July 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Symmetry properties of polytopes (52B15)
Related Items (11)
Automorphism groups and normal forms in Normaliz ⋮ Applying mod-\(k\)-cuts for solving linear ordering problems ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Weak order polytopes. ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ The biorder polytope ⋮ Facets of the linear ordering polytope: a unification for the fence family through weighted graphs ⋮ How to recycle your facets ⋮ Analysis of multinomial models under inequality constraints: applications to measurement theory ⋮ A combinatorial study of partial order polytopes ⋮ On the combinatorial structure of the approval-voting polytope
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- More facets from fences for linear ordering and acyclic subgraph polytopes
- An approval-voting polytope for linear orders
- On the combinatorial structure of the approval-voting polytope
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- A note on small linear-ordering polytopes
- Lectures on Polytopes
- The strongest facets of the acyclic subgraph polytope are unknown
- New Facets of the Linear Ordering Polytope
- The interval order polytope of a digraph
This page was built for publication: Determining the automorphism group of the linear ordering polytope
