Lemke Paths on Simple Polytopes
From MaRDI portal
Publication:4698100
DOI10.1287/MOOR.19.4.780zbMATH Open0821.90116OpenAlexW2011198944MaRDI QIDQ4698100FDOQ4698100
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
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
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)
Cited In (10)
- Carlyle Circles and the Lemoine Simplicity of Polygon Constructions
- On finding another room-partitioning of the vertices
- Finding Gale strings
- Oriented Euler complexes and signed perfect matchings
- Imitation games and computation
- Exponentiality of the exchange algorithm for finding another room-partitioning
- Simplex-like trajectories on quasi-polyhedral sets.
- Extended \(P\)-pairs
- Maximal nonrevisiting paths in simple polytopes
- Euler complexes (oiks)
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)
