Lemke Paths on Simple Polytopes

DOI10.1287/MOOR.19.4.780MaRDI QIDQ4698100zbMATHOpenAlexFDO

Authors Walter Morris

Publication date 14 May 1995

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.19.4.780

zbMATH Keywords

Lemke paths

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Simple paths on polyhedra
• Short simplex paths in lattice polytopes
• Simple convex polytopes and the strong Lefschetz theorem
• Hard Lefschetz theorem for simple polytopes
• Monotone paths on polytopes
• Paths on polymatroids
• Paths on Polyhedra. I
• Maximal nonrevisiting paths in simple polytopes
• On the length of monotone paths in polyhedra
• Long monotone paths on simple 4-polytopes

Cited in

(10)

• Exponentiality of the exchange algorithm for finding another room-partitioning
• Imitation games and computation
• Euler complexes (oiks)
• Extended \(P\)-pairs
• Finding Gale strings
• Simplex-like trajectories on quasi-polyhedral sets.
• Carlyle Circles and the Lemoine Simplicity of Polygon Constructions
• On finding another room-partitioning of the vertices
• Oriented Euler complexes and signed perfect matchings
• Maximal nonrevisiting paths in simple polytopes

This page was built for publication: Lemke Paths on Simple Polytopes

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