AbstractGiven an undirected graph G, a uniform cut polytope is defined as the convex hull of the incidence vectors of the cuts in G for which the size of the shores are fixed.In this paper we show that simple extensions of facet-defining inequalities for the equipartition polytope introduced by Conforti et al. in [5,6] provide facet-defining inequalities for uniform cut polyhedra
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
AbstractGiven an undirected graph G, a uniform cut polytope is defined as the convex hull of the inc...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
AbstractWe study facets of the k-partition polytope Pk,n, the convex hull of edges cut by r-partitio...
Given a graph G = (V, E), a cut in G that partitions V into two sets with right perpendicular 1/2V l...
The max-cut problem and the associated cut polytope on complete graphs have been extensively studied...
The cut polyhedron cut(G) of an undirected graph G = (V, E) is the dominant of the convex hull of al...
The cut polyhedron cut(G) of an undirected graph G = (V, E) is the dominant of the convex hull of al...
AbstractFor an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
AbstractGiven an undirected graph G, a uniform cut polytope is defined as the convex hull of the inc...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
AbstractWe study facets of the k-partition polytope Pk,n, the convex hull of edges cut by r-partitio...
Given a graph G = (V, E), a cut in G that partitions V into two sets with right perpendicular 1/2V l...
The max-cut problem and the associated cut polytope on complete graphs have been extensively studied...
The cut polyhedron cut(G) of an undirected graph G = (V, E) is the dominant of the convex hull of al...
The cut polyhedron cut(G) of an undirected graph G = (V, E) is the dominant of the convex hull of al...
AbstractFor an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
DOI
Add to ORKG