On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
From MaRDI portal
Publication:1906776
DOI10.1016/0024-3795(94)00063-8zbMath0842.05038OpenAlexW2029308832MaRDI QIDQ1906776
Publication date: 28 July 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(94)00063-8
Related Items (8)
A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ *-graphs of vertices of the generalized transitive tournament polytope ⋮ Half-integrality of vertices of the generalized transitive tournament polytope \((n=6)\) ⋮ On approximability of linear ordering and related NP-optimization problems on graphs. ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On the cycle polytope of a directed graph and its relaxations ⋮ On characterizing the extreme points of the generalized transitive tournament polytope ⋮ Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs
Uses Software
Cites Work
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- Generalized transitive tournaments and doubly stochastic matrices
- On removing a vertex from the assignment polytope
- More facets from fences for linear ordering and acyclic subgraph polytopes
- A necessary but insufficient condition for the stochastic binary choice problem
- \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope
- On the integral dicycle packings and covers and the linear ordering polytope
- A note on small linear-ordering polytopes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
