We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a “ring”) to which each edge belongs, does not exceed a given length K. We identify a class of inequalities, called cycle inequalities, valid for the problem and show that these inequalities together with the so-called cut inequalities yield an integer programming formulation of the problem in the space of the natural design variables. We then study the polytope associated with that problem and describe further classes of valid inequalities. We give necessary and sufficient conditions for these inequalities to be facet defining. We study the separation problem associated with these inequalities. In pa...
International audienceIn this article, we consider the k-edge connected subgraph problem from a poly...
This article deals with the Two-edge connected Hop-constrained Network Design Problem (or THNDP for ...
The linear programming cutting plane method has proven to be quite successful for solving certain "h...
We consider the network design problem which consists in determining at minimum cost a 2-edge connec...
We consider the network design problem which consists in determining at minimum cost a 2-edge connec...
We study the polyhedron associated with a network design problem which consists in determining at mi...
We study the problem of designing at minimum cost a two-connected network such that each edge belong...
We study the problem of designing at minimum cost a two-connected network such that each edge belong...
This book studies the problem of designing, at minimal cost, a two-connected network such that each ...
We study the problem of designing at minimum cost a two-connected network such that the shortest cyc...
In this article, we consider the k-edge connected subgraph problem from a polyhedral point of view. ...
International audienceIn this article, we consider the k-edge connected subgraph problem from a poly...
This article deals with the Two-edge connected Hop-constrained Network Design Problem (or THNDP for ...
International audienceIn this article, we consider the k-edge connected subgraph problem from a poly...
This article deals with the Two-edge connected Hop-constrained Network Design Problem (or THNDP for ...
International audienceIn this article, we consider the k-edge connected subgraph problem from a poly...
This article deals with the Two-edge connected Hop-constrained Network Design Problem (or THNDP for ...
The linear programming cutting plane method has proven to be quite successful for solving certain "h...
We consider the network design problem which consists in determining at minimum cost a 2-edge connec...
We consider the network design problem which consists in determining at minimum cost a 2-edge connec...
We study the polyhedron associated with a network design problem which consists in determining at mi...
We study the problem of designing at minimum cost a two-connected network such that each edge belong...
We study the problem of designing at minimum cost a two-connected network such that each edge belong...
This book studies the problem of designing, at minimal cost, a two-connected network such that each ...
We study the problem of designing at minimum cost a two-connected network such that the shortest cyc...
In this article, we consider the k-edge connected subgraph problem from a polyhedral point of view. ...
International audienceIn this article, we consider the k-edge connected subgraph problem from a poly...
This article deals with the Two-edge connected Hop-constrained Network Design Problem (or THNDP for ...
International audienceIn this article, we consider the k-edge connected subgraph problem from a poly...
This article deals with the Two-edge connected Hop-constrained Network Design Problem (or THNDP for ...
International audienceIn this article, we consider the k-edge connected subgraph problem from a poly...
This article deals with the Two-edge connected Hop-constrained Network Design Problem (or THNDP for ...
The linear programming cutting plane method has proven to be quite successful for solving certain "h...