Extended Node-Arc Formulation for the K-Edge-Disjoint Hop-Constrained Network Design Problem

Abstract

This paper considers the K-edge-disjoint hop-constrained Network Design Problem (HCNDP) which consists in finding a minimum cost subgraph such that there exists at least K-edge-disjoint paths between origins and destinations of demands, and such that the length of these paths is at most equal to a given parameter L. This problem was considered in the past using only design variables. Here, we consider an extended node-arc formulation, introducing flow variables to model the paths. We conjecture that our formulation leads to the complete description of the associated polyhedron and we provide an algorithm leading to good performances in terms of computing times.

1 Figure or Table

Cite this paper

@inproceedings{Botton2007ExtendedNF, title={Extended Node-Arc Formulation for the K-Edge-Disjoint Hop-Constrained Network Design Problem}, author={Quentin Botton and Bernard Fortz}, year={2007} }