We study facets of the cut coneC n , i.e., the cone of dimension 1/2n(n − 1) generated by the cuts of the complete graph onn vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a “lifting” procedure for constructing facets ofC n+1 from given facets of the lower dimensional coneC n . After reviewing hypermetric valid inequalities, we describe the new class of cycle inequalities and prove the facet property for several subclasses. The new class of parachute facets is developed and other known facets and valid inequalities are presented
jockusch(a3 mat h.lsa.umich.edu Abstract. We construct a family of cubical polytypes which shows tha...
A caterpillar is a connected graph such that the removal of all its vertices with degree 1 results i...
We find new facet-defining inequalities for the linear ordering polytope generalizing the well-known...
We study new classes of facets for the cut coneC n generated by the cuts of the complete graph onn v...
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...
The cut cone C_n is the cone generated by the cuts of the complete graph on n nodes. In this paper, ...
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite...
AbstractGiven a complete graph Kn on n nodes and a subset S of nodes, the cut δ(S) defined by S is t...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
AbstractFor an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex...
Given a graph G = (V, E), a cut in G that partitions V into two sets with right perpendicular 1/2V l...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
Motivated by problems involving triangle-decompositions of graphs, we examine the facet structure of...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
In this paper we study the directed cut cone and polytope which are the positive hull and convex hul...
jockusch(a3 mat h.lsa.umich.edu Abstract. We construct a family of cubical polytypes which shows tha...
A caterpillar is a connected graph such that the removal of all its vertices with degree 1 results i...
We find new facet-defining inequalities for the linear ordering polytope generalizing the well-known...
We study new classes of facets for the cut coneC n generated by the cuts of the complete graph onn v...
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...
The cut cone C_n is the cone generated by the cuts of the complete graph on n nodes. In this paper, ...
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite...
AbstractGiven a complete graph Kn on n nodes and a subset S of nodes, the cut δ(S) defined by S is t...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
AbstractFor an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex...
Given a graph G = (V, E), a cut in G that partitions V into two sets with right perpendicular 1/2V l...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
Motivated by problems involving triangle-decompositions of graphs, we examine the facet structure of...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
In this paper we study the directed cut cone and polytope which are the positive hull and convex hul...
jockusch(a3 mat h.lsa.umich.edu Abstract. We construct a family of cubical polytypes which shows tha...
A caterpillar is a connected graph such that the removal of all its vertices with degree 1 results i...
We find new facet-defining inequalities for the linear ordering polytope generalizing the well-known...