On combinatorial properties of linear program digraphs

MaRDI QIDQ3622252zbMATH OpenFDO

Authors David Avis, Sonoko Moriyama

Publication date 28 April 2009

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Extreme-point and pivoting methods (90C49)

Recommendations

• Families of polytopal digraphs that do not satisfy the shelling property
• Linear programming, the simplex algorithm and simple polytopes
• Simplex adjacency graphs in linear optimization
• On the Holt-Klee property for oriented matroid programming
• Finding a simple polytope from its graph in polynomial time

Cited in

(9)

• On linear combinatorics. I: Concurrency---an algebraic approach
• Laplacian simplices associated to digraphs
• Families of polytopal digraphs that do not satisfy the shelling property
• Refuting conjectures in extremal combinatorics via linear programming
• On the Holt-Klee property for oriented matroid programming
• Simplex adjacency graphs in linear optimization
• An exponential lower bound for Cunningham's rule
• A combinatorial bound for linear programming and related problems
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

This page was built for publication: On combinatorial properties of linear program digraphs

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