An improved vertex enumeration algorithm

DOI10.1016/0377-2217(82)90180-1zbMath0477.90035OpenAlexW2084324684WikidataQ56324200 ScholiaQ56324200MaRDI QIDQ1160560

L. G. Proll, Martin Dyer

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90180-1

zbMATH Keywords

convex polytopeadjacency testimplementation strategyalgorithmic performancebarred pivot strategydetermination of all verticesDyer-Proll algorithmimproved vertex enumeration algorithmpivoting methodsredundant branch removalsearch tree labelling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Related Items (9)

Solving general continuous single facility location problems by cutting planes ⋮ Errors bounds for finite approximations of coherent lower previsions on finite probability spaces ⋮ A new pivoting rule for solving various degeneracy problems ⋮ Scenario-based portfolio model for building robust and proactive strategies ⋮ Lower subdifferentiable functions and their minimization by cutting planes ⋮ Pivoting rules and redundancy schemes in extreme point enumeration ⋮ Selected bibliography on degeneracy ⋮ Degeneracy graphs: Theory and applications. An updated survey ⋮ An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex

Cites Work

• Finding all vertices of a convex polyhedron
• Computational results on an algorithm for finding all vertices of a polytope
• 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
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved vertex enumeration algorithm