On non-\0,1 2,1\ extreme points of the generalized transitive tournament polytope

DOI10.1016/0024-3795(94)00063-8MaRDI QIDQ1906776zbMATH OpenOpenAlexFDO

Authors Zeev Nutov, Michal Penn

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

zbMATH Keywords

acyclic tournamentsextreme pointslinear ordering polytopetransitive tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Programming involving graphs or networks (90C35)

Recommendations

• On characterizing the extreme points of the generalized transitive tournament polytope
• \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope
• scientific article; zbMATH DE number 1153445
• Half-integrality of vertices of the generalized transitive tournament polytope \((n=6)\)
• On the cycle polytope of a directed graph and its relaxations

Cites work

• \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope
• A necessary but insufficient condition for the stochastic binary choice problem
• A note on small linear-ordering polytopes
• Generalized transitive tournaments and doubly stochastic matrices
• Geometric and combinatorial properties of the polytope of binary choice probabilities
• Graph theory
• scientific article; zbMATH DE number 3888925 (Why is no real title available?)
• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• scientific article; zbMATH DE number 3902393 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3683298 (Why is no real title available?)
• More facets from fences for linear ordering and acyclic subgraph polytopes
• On removing a vertex from the assignment polytope
• On the integral dicycle packings and covers and the linear ordering polytope

Cited in

(9)

• *-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.
• On characterizing the extreme points of the generalized transitive tournament polytope
• Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs
• A survey on the linear ordering problem for weighted or unweighted tournaments
• On the cycle polytope of a directed graph and its relaxations
• Extreme points of two digraph polytopes: Description and applications in economics and game theory
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

Describes a project that uses

Uses Software

• LOLIB

This page was built for publication: On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906776)