AbstractWe introduce polyhedral cones and polytopes, associated with quasi-semi-metrics (oriented distances), in particular with oriented multi-cuts, on n points. We compute generators and facets of these polyhedra for small values of n and study their graphs
A partial semimetric on a set X is a function $(x, y) \mapsto p(x, y) \in \RR_{\geq 0}$ satisfying $...
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite...
In a projective space PG(n, q) a quasi-quadric is a set of points that has the same intersection num...
We introduce polyhedral cones and polytopes, associated with quasi-semi-metrics (oriented dis-tances...
AbstractWe introduce polyhedral cones and polytopes, associated with quasi-semi-metrics (oriented di...
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinati...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
This paper brings together several topics arising in distinct areas: polyhedral combinatorics, in pa...
AbstractWe introduce polyhedral cones associated with m-hemimetrics on n points, and, in particular,...
We study new classes of facets for the cut coneC n generated by the cuts of the complete graph onn v...
A new combinatorial structure, the semicut in a graph, is defined as a generalization of a cut. Extr...
There the combinative cones and polyhedrons are studied. The series of problems of polyhedral combin...
International audienceGiven a graph G=(V,E)G=(V,E) with |V|=n|V|=n and |E|=m|E|=m, we consider the m...
International audienceGiven a graph G = (V, E) with |V | = n and |E| = m, we consider the metric con...
We consider convex polyhedra with applications to well-known combinatorial optimization problems: th...
A partial semimetric on a set X is a function $(x, y) \mapsto p(x, y) \in \RR_{\geq 0}$ satisfying $...
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite...
In a projective space PG(n, q) a quasi-quadric is a set of points that has the same intersection num...
We introduce polyhedral cones and polytopes, associated with quasi-semi-metrics (oriented dis-tances...
AbstractWe introduce polyhedral cones and polytopes, associated with quasi-semi-metrics (oriented di...
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinati...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
This paper brings together several topics arising in distinct areas: polyhedral combinatorics, in pa...
AbstractWe introduce polyhedral cones associated with m-hemimetrics on n points, and, in particular,...
We study new classes of facets for the cut coneC n generated by the cuts of the complete graph onn v...
A new combinatorial structure, the semicut in a graph, is defined as a generalization of a cut. Extr...
There the combinative cones and polyhedrons are studied. The series of problems of polyhedral combin...
International audienceGiven a graph G=(V,E)G=(V,E) with |V|=n|V|=n and |E|=m|E|=m, we consider the m...
International audienceGiven a graph G = (V, E) with |V | = n and |E| = m, we consider the metric con...
We consider convex polyhedra with applications to well-known combinatorial optimization problems: th...
A partial semimetric on a set X is a function $(x, y) \mapsto p(x, y) \in \RR_{\geq 0}$ satisfying $...
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite...
In a projective space PG(n, q) a quasi-quadric is a set of points that has the same intersection num...
DOI
Add to ORKG