Polynomial time vertex enumeration of convex polytopes of bounded branch-width

Abstract

In the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by inequalities. In this paper we apply the concept of branch-decomposition to the vertex enumeration problem of polyhedra P = {x : Sx… (More)

Topics

1 Figure or Table

Slides referencing similar topics