Keyword: polytopes

Found 15 papers in total
Integer‐empty polytopes in the 0/1‐cube with maximal Gomory–Chvátal rank
Integer‐empty polytopes in the 0/1‐cube with maximal Gomory–Chvátal rank
2011,
We provide a complete characterization of all polytopes P ⊆ [ 0 , 1 ] n with...
Projecting Lattice Polytopes Without Interior Lattice Points
Projecting Lattice Polytopes Without Interior Lattice Points
2011,
We show that up to unimodular equivalence in each dimension there are only finitely...
On the facets of the stable set polytope of quasi‐line graphs
On the facets of the stable set polytope of quasi‐line graphs
2011,
While the Ben Rebea Theorem provides a complete linear description of the stable set...
Composition of stable set polyhedra
Composition of stable set polyhedra
2008,
Barahona and Mahjoub found a defining system of the stable set polytope for a graph...
Explicit polyhedral approximation of the Euclidean ball
Explicit polyhedral approximation of the Euclidean ball
2010,
We discuss the problem of computing points of I R n whose convex hull contains the...
On the Steiner 2-edge connected subgraph polytope
On the Steiner 2-edge connected subgraph polytope
2008,
In this paper, we study the Steiner 2–edge connected subgraph polytope. We...
Computation of the Lasserre ranks of some polytopes
Computation of the Lasserre ranks of some polytopes
2007,
Over the years, various lift‐and‐project methods have been proposed to...
The symmetric traveling salesman polytope: New facets from the graphical relaxation
The symmetric traveling salesman polytope: New facets from the graphical relaxation
2007,
The path, the wheelbarrow, and the bicycle inequalities have been shown by...
Primal separation for 0/1 polytopes
Primal separation for 0/1 polytopes
2003,
The 0/1 primal separation problem is: Given an extreme point &xmacr; of a 0/1 polytope...
Facets with fixed defect of the stable set polytope
Facets with fixed defect of the stable set polytope
2000,
The stable set polytope of a graph is the convex hull of the 0–1 vectors...
Regular polytopes in ordinary space
Regular polytopes in ordinary space
1997,
The three aims of this paper are to obtain the proof by Dress of the completeness of...
Polytopes and the mean value property
Polytopes and the mean value property
1997,
Let P be any (not necessarily convex nor connected) solid polytope in the n...
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
1997,
We introduce a new method of proving lower bounds on the depth of algebraic d -degree...
A note on the Boolean quadric polytope
A note on the Boolean quadric polytope
1996,
We observe that a new class of facet-defining inequalities for the Boolean quadric...
Segments in enumerating faces
Segments in enumerating faces
1995,
The authors introduce the concept of a segment of a degenerate convex polytope...
Papers per page: