Boosting Set Constraint Propagation for Network Design - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Boosting Set Constraint Propagation for Network Design

Justin Yip
  • Fonction : Auteur
Pascal van Hentenryck
  • Fonction : Auteur
Carmen Gervet

Résumé

This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, using either MIP or CP technologies, focused on symmetry breaking, including the use of SBDS, and the design of effective branching strategies. This paper advocates an orthogonal approach and argues that the thrashing behavior experienced in earlier attempts is primarily due to a lack of pruning. It studies how to improve domain filtering by taking a more global view of the application and imposing redundant global constraints. The technical results include novel hardness results, propagation algorithms for global constraints, and inference rules. The paper also evaluates the contributions experimentally by presenting a novel model with static symmetric-breaking constraints and a static variable ordering which is many orders of magnitude faster than existing approaches.
Fichier principal
Vignette du fichier
cpaior10.pdf (203.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01741593 , version 1 (23-03-2018)

Identifiants

  • HAL Id : hal-01741593 , version 1

Citer

Justin Yip, Pascal van Hentenryck, Carmen Gervet. Boosting Set Constraint Propagation for Network Design. CPAIOR, 2010, Bologna Italy. ⟨hal-01741593⟩
39 Consultations
104 Téléchargements

Partager

Gmail Facebook X LinkedIn More