Segments in enumerating faces

DOI10.1007/BF01585927zbMath0841.90105OpenAlexW2032345707MaRDI QIDQ1904658

Sung-Jin Chung, Katta G. Murty

Publication date: 24 July 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

adjacencyenumeration of facessegment of a degenerate convex polytope

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (6)

Pooling problems with polynomial-time algorithms ⋮ Compactness criteria for real algebraic sets and Newton polyhedra ⋮ Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. ⋮ Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems ⋮ Finding and identifying optimal inventory levels for systems with common components ⋮ A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes

Cites Work

• Unnamed Item
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• An algorithm for enumerating all vertices of a convex polyhedron
• Combinatorial face enumeration in convex polytopes
• Finding all vertices of a convex polyhedron
• The graph of an abstract polytope
• The Complexity of Vertex Enumeration Methods
• Finding the convex hull facet by facet
• On the complexity of four polyhedral set containment problems
• Intermediate feasibility in 0–1 integer linear systems
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• An algorithm for determining all extreme points of a convex polytope

This page was built for publication: Segments in enumerating faces