Concept
Facet (geometry)
Related publications (19)
0/1 vertex and facet enumeration with BDDs
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, ...
2007On the facet-to-facet property of solutions to convex parametric quadratic programs
In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...
Elsevier2006On the facet-to-facet property of solutions to convex parametric quadratic programs
In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...
2006On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
Thomas Liebling, Gautier Stauffer
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Giles and Trotter [7] by (i) showing that for any nonnegative integer a there exists a circulant graph whose stable set polytope has a facet-inducing inequali ...
Springer-Verlag2004on Non-Rank Facets of the Stable Set Polytope of Claw-Free Graphs and Circulant Graphs
Thomas Liebling, Gautier Stauffer
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Gilles and Trotter (7) by (i) showing that for any nonnegative integer a there exists a circulant graph whose stable set polytope has a facet-inducing inequal ...
2003Extended convex hull
In this paper we address the problem of computing a minimal representation of the convex hull of the union of k H- polytopes in . Our method applies the reverse search algorithm to a shelling ordering of the facets of the convex hull. Efficient wrapping is ...
2001On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons
This work is concerned with the computational complexity of the recognition of , the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of of particular interest are also studi ...
1999On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons
This work is concerned with the computational complexity of the recognition of , the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of of particular interest are also studi ...
IDIAP1998A general algorithm for 3-D shape interpolation in a facet-based representation
Concerned with interpolation between two objects defined using a faceted representation. The interpolation function is not examined, but the paper emphasizes the problem of correspondence between the two given key drawings. The problem is much more complex ...
1988