Long Monotone Paths in Abstract Polytopes

DOI10.1287/MOOR.1.1.89MaRDI QIDQ3907403zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(8)

• Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
• Completely unimodal numberings of a simple polytope
• Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
• A combinatorial generalization of polytopes
• Unique sink orientations of grids
• A unified approach to complementarity in optimization
• Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
• 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

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