Completely unimodal numberings of a simple polytope

DOI10.1016/0166-218X(88)90042-XzbMath0652.90077OpenAlexW2047614799MaRDI QIDQ1107444

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

average complexitypseudo-Boolean optimizationAbstract objective functionscompletely unimodal numberingsdual simplicial polytopeGreedy Algorithmlocally optimization heuristicsRandom Algorithm

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• The graph of an abstract polytope
• Long Monotone Paths in Abstract Polytopes
• Which Spheres are Shellable?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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