Campus Event Calendar
Event Entry
What and Who
0/1 vertex and facet enumeration with BDDs
Markus Behle
Max-Planck-Institut für Informatik - D 1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, SWS
AG Audience
-- Not specified --
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 19 December 2006
13:30
20 Minutes
E1 4
024
Saarbrücken
Abstract
In polyhedral studies of 0/1 polytopes two prominent problems exist.
One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points.
Another one is the convex hull problem: Given a set of 0/1 points in dimension d, enumerate the facets of the corresponding polytope.
We developed two new approaches for both problems. The novelty of our algorithms is the incorporation of binary decision diagrams (BDDs).
In this talk I will only concentrate on the vertex enumeration problem. Our new tool "azove" will be introduced, which is currently the fastest software for counting and enumerating 0/1 points in a polytope.
Contact
Markus Behle
--email hidden
passcode not visible
logged in users only
Markus Behle, 12/06/2006 11:44
Markus Behle, 12/06/2006 11:43 -- Created document.
Markus Behle, 12/06/2006 11:43 -- Created document.