Sciweavers

Share
CPAIOR
2010
Springer

Boosting Set Constraint Propagation for Network Design

9 years 2 months ago
Boosting Set Constraint Propagation for Network Design
Abstract. 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 symmetricbreaking constraints and a static variable ordering which is many orders of magnitude faster than existing approaches.
Justin Yip, Pascal Van Hentenryck, Carmen Gervet
Added 24 Jan 2011
Updated 24 Jan 2011
Type Journal
Year 2010
Where CPAIOR
Authors Justin Yip, Pascal Van Hentenryck, Carmen Gervet
Comments (0)
books