Characterizations of adjacency of faces of polyhedra

DOI10.1007/BFb0120917zbMath0449.90069OpenAlexW51636389MaRDI QIDQ3896843

Martin Grötschel, Achim Bachem

Publication date: 1981

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120917

zbMATH Keywords

computational complexitypolynomial algorithmsface latticeellipsoid methodadjacency of verticesadjacency of facescomputational adjacency determinationminimal generating system of a polyhedronnonredundancy of linear inequality systemstheory of polyhedra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Related Items (3)

Efficient constraint/generator removal from double description of polyhedra ⋮ Structure of a simple scheduling polyhedron ⋮ Method of ellipsoids, its generalizations and applications

This page was built for publication: Characterizations of adjacency of faces of polyhedra