A note on small linear-ordering polytopes
From MaRDI portal
Publication:2368130
DOI10.1007/BF02573963zbMath0784.90063OpenAlexW2075716284MaRDI QIDQ2368130
Publication date: 2 September 1993
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131260
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items
Applying mod-\(k\)-cuts for solving linear ordering problems, On the integral dicycle packings and covers and the linear ordering polytope, Complete linear descriptions of small asymmetric traveling salesman polytopes, A survey on the linear ordering problem for weighted or unweighted tournaments, On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope, Probabilistic biclassification and random variable representations, On the partial order polytope of a digraph, Revised GRASP with path-relinking for the linear ordering problem, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Determining the automorphism group of the linear ordering polytope, Combinatorial optimization and small polytopes, On the linear ordering problem and the rankability of data, Signed orders, choice probabilities, and linear polytopes, A combinatorial study of partial order polytopes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Storing line segments in partition trees
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- A complete description of the traveling salesman polytope on 8 nodes
- Oriented matroids
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Maximum likelihood paired comparison ranking by linear programming
- Regular d-valent graphs of girth 6 and 2(d2−d+1) vertices
- Permutation Polyhedra
- Binary Probabilities Induced by Rankings
