Listing vertices of simple polyhedra associated with dual LI(2) systems

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an O(nv) Basis Oriented Pivoting (BOP) algorithm for enumerating vertices of simple polyhedra associated with dual LI(2) systems. The algorithm is based on a characterisation of their graphical basis structures, whose set of edges are shown to consist of vertex-disjoint components that are either a tree or a subgraph with only one cycle. The algorithm generates vertices via operations on the basis graph, rather than by simplex transformations. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Abdullahi, S. D., Dyer, M. E., & Proll, L. G. (2003). Listing vertices of simple polyhedra associated with dual LI(2) systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2731, 89–96. https://doi.org/10.1007/3-540-45066-1_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free