Completely unimodal numberings of a simple polytope

DOI10.1016/0166-218X(88)90042-XMaRDI QIDQ1107444zbMATH OpenOpenAlexFDO

Authors Kathy Williamson Hoke

Publication date 1988

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(88)90042-x

zbMATH Keywords

Abstract objective functionsaverage complexitycompletely unimodal numberingsdual simplicial polytopeGreedy Algorithmlocally optimization heuristicspseudo-Boolean optimizationRandom Algorithm

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Integer programming (90C10)

Recommendations

• The Random‐Facet simplex algorithm on combinatorial cubes
• Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
• Combinatorial face enumeration in convex polytopes
• From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
• Linear programming, the simplex algorithm and simple polytopes

Cites work

• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• scientific article; zbMATH DE number 4004228 (Why is no real title available?)
• scientific article; zbMATH DE number 3726093 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 3586175 (Why is no real title available?)
• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• scientific article; zbMATH DE number 3235051 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• Long Monotone Paths in Abstract Polytopes
• The graph of an abstract polytope
• Which Spheres are Shellable?

Cited in

(13)

• Geometry of cut-complexes and threshold logic
• Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
• Unique end of potential line
• A note on shellability and acyclic orientations
• Random edge can be exponential on abstract cubes
• The Random‐Facet simplex algorithm on combinatorial cubes
• Unique End of Potential Line
• Random walks on polytopes of constant corank
• On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes
• Combinatorial structure and randomized subexponential algorithms for infinite games
• A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
• Unique sink orientations of grids
• Cyclic games and linear programming

This page was built for publication: Completely unimodal numberings of a simple polytope

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