Distance transformation for network design problems
Mahjoub, Ali Ridha; Poss, Michael; Simonetti, Luidi; Uchoa, Eduardo (2019), Distance transformation for network design problems, SIAM Journal on Optimization, 29, 2, p. 1687-1713. 10.1137/16M1108261
TypeArticle accepté pour publication ou publié
Journal nameSIAM Journal on Optimization
SIAM - Society for Industrial and Applied Mathematics
MetadataShow full item record
Author(s)Mahjoub, Ali Ridha
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier [LIRMM]
Federal University of Rio de Janeiro
Abstract (EN)We propose a new generic way to construct extended formulations for a large class of network design problems with given connectivity requirements. The approach is based on a graph transformation that maps any graph into a layered graph according to a given distance function. The original connectivity requirements are in turn transformed into equivalent connectivity requirements in the layered graph. The mapping is extended to the graphs induced by fractional vectors through an extended linear integer programming formulation. While graphs induced by binary vectors are mapped to isomorphic layered graphs, those induced by fractional vectors are mapped to a set of graphs having worse connectivity properties. Hence, the connectivity requirements in the layered graph may cut off fractional vectors that were feasible for the problem formulated in the original graph. Experiments over instances of the Steiner forest and hop-constrained survivable network design problems show that significant gap reductions compared with state-of-the art formulations can be obtained.
Subjects / KeywordsExtended Formulations; Network Design; Benders decomposition
Showing items related by title and author.