The natural linear programming formulation of the maximum s-t-flow problem in path variables has a dual linear program whose underlying polyhedron is the dominant P↑s-t-cut of the s-t-cut polytope. We present a complete characterization of P↑s-t-cut with respect to vertices, facets, and adjacency
International audienceThe problem of separation is to find an affine hyperplane, or "cut", that lies...
AbstractA general theorem on the nesting property of minimum cuts in a parametric network and its co...
The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate som...
The natural linear programming formulation of the maximum s-t-flow problem in path-variables has a d...
Consider the polyhedron represented by the dual of the LP formulation of the maximums–t flow problem...
Cut problems on graphs are a well-known and intensively studied class of optimization problems. In ...
The cut polyhedron cut(G) of an undirected graph G = (V, E) is the dominant of the convex hull of al...
A new combinatorial structure, the semicut in a graph, is defined as a generalization of a cut. Extr...
FACEPEA polytope P is a model for a combinatorial problem on finite graphs G whose variables are ind...
AbstractFor an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex...
We study the multicut and the sparsest cut problems in directed graphs. In the multicut problem, we ...
AbstractWe introduce a new class of problems concerned with the computation of maximum flows through...
The max-cut problem is a fundamental and much-studied NP-hard combinatorial optimisation problem, wi...
In this paper we study linear optimization problems with a newly introduced concept of multi-dimensi...
We study a mixed integer linear program with m integer variables and k non-negative continu...
International audienceThe problem of separation is to find an affine hyperplane, or "cut", that lies...
AbstractA general theorem on the nesting property of minimum cuts in a parametric network and its co...
The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate som...
The natural linear programming formulation of the maximum s-t-flow problem in path-variables has a d...
Consider the polyhedron represented by the dual of the LP formulation of the maximums–t flow problem...
Cut problems on graphs are a well-known and intensively studied class of optimization problems. In ...
The cut polyhedron cut(G) of an undirected graph G = (V, E) is the dominant of the convex hull of al...
A new combinatorial structure, the semicut in a graph, is defined as a generalization of a cut. Extr...
FACEPEA polytope P is a model for a combinatorial problem on finite graphs G whose variables are ind...
AbstractFor an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex...
We study the multicut and the sparsest cut problems in directed graphs. In the multicut problem, we ...
AbstractWe introduce a new class of problems concerned with the computation of maximum flows through...
The max-cut problem is a fundamental and much-studied NP-hard combinatorial optimisation problem, wi...
In this paper we study linear optimization problems with a newly introduced concept of multi-dimensi...
We study a mixed integer linear program with m integer variables and k non-negative continu...
International audienceThe problem of separation is to find an affine hyperplane, or "cut", that lies...
AbstractA general theorem on the nesting property of minimum cuts in a parametric network and its co...
The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate som...
DOI
Add to ORKG