Boosting set constraint propagation for network design

DOI10.1007/978-3-642-13520-0_37MaRDI QIDQ3569943zbMATH OpenOpenAlexFDO

Authors Justin Yip, Pascal Van Hentenryck, Carmen Gervet

Publication date 22 June 2010

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://hal.umontpellier.fr/hal-01741593/file/cpaior10.pdf

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Symmetry and Search in a Network Design Problem
• A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
• Principles and Practice of Constraint Programming – CP 2004
• The complexity of reasoning with global constraints
• Generalizing Global Constraints Based on Network Flows

Cited in

(1)

• Symmetry and Search in a Network Design Problem

This page was built for publication: Boosting set constraint propagation for network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569943)