Long Monotone Paths in Abstract Polytopes

DOI10.1287/moor.1.1.89zbMath0457.90047OpenAlexW1969171285MaRDI QIDQ3907403

Ilan Adler, Romesh Saigal

Publication date: 1976

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

Full work available at URL: https://semanticscholar.org/paper/f4d2696debf1dd3bb7b0b4a58ed3501b74329017

zbMATH Keywords

polynomial algorithmsimplex methodabstract polytopeslong monotone paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Enumeration in graph theory (05C30) Polytopes and polyhedra (52Bxx)

Related Items (8)

Completely unimodal numberings of a simple polytope ⋮ Polyhedral graph abstractions and an approach to the linear Hirsch conjecture ⋮ Unique sink orientations of grids ⋮ Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count ⋮ A unified approach to complementarity in optimization ⋮ A combinatorial generalization of polytopes ⋮ Unnamed Item ⋮ On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes

This page was built for publication: Long Monotone Paths in Abstract Polytopes