An improved vertex enumeration algorithm (Q1160560): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algorithm for determining all extreme points of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5621733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all vertices of a convex polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results on an algorithm for finding all vertices of a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets / rank
 
Normal rank

Latest revision as of 14:53, 13 June 2024

scientific article
Language Label Description Also known as
English
An improved vertex enumeration algorithm
scientific article

    Statements

    An improved vertex enumeration algorithm (English)
    0 references
    0 references
    0 references
    1982
    0 references
    improved vertex enumeration algorithm
    0 references
    pivoting methods
    0 references
    convex polytope
    0 references
    Dyer-Proll algorithm
    0 references
    implementation strategy
    0 references
    barred pivot strategy
    0 references
    adjacency test
    0 references
    determination of all vertices
    0 references
    search tree labelling
    0 references
    redundant branch removal
    0 references
    algorithmic performance
    0 references

    Identifiers