论文信息 - Streamlined Constraint Reasoning

Streamlined Constraint Reasoning

We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search first towards a small and structured combinatorial subspace. The streamlining constraints capture regularities observed in a subset of the solutions to smaller problem instances. We demonstrate the effectiveness of our approach by solving a number of hard combinatorial design problems. Our experiments show that streamlining scales significantly beyond previous approaches.

Meinolf Sellmann | Carla P. Gomes | C. Gomes | Meinolf Sellmann

[1] R. C. Bose,et al. Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture , 1960, Canadian Journal of Mathematics.

[2] Carl Libis,et al. How Many Magic Squares are There? , 2000 .

[3] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[4] Meinolf Sellmann,et al. The Challenge of Generating Spatially Balanced Scientific Experiment Designs , 2004, CPAIOR.

[5] Michela Milano,et al. Global Cut Framework for Removing Symmetries , 2001, CP.

[6] Meinolf Sellmann,et al. Symmetry Breaking , 2001, CP.

[7] Krzysztof R. Apt,et al. The Rough Guide to Constraint Propagation , 1999, CP.

[8] Jean-Charles Régin,et al. A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[9] Philippe Codognet,et al. An Efficient Library for Solving CSP with Local Search , 2003 .

[10] Martin Gardner,et al. The Wonders of Magic Squares , 1982 .

[11] B. Hnich,et al. Âóùöòòð Óó Öøø¬ Blockin , 2000 .

[12] C. L. van Es,et al. Spatial Nature of Randomization and Its Effect on the Outcome of Field Experiments , 1993 .