Location of Repository

In Proc. Conf. Principles and Practice of Constraint Programming, 2004. Streamlined Constraint Reasoning ⋆

By Carla Gomes and Meinolf Sellmann

Abstract

Abstract. 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

Topics: constraint reasoning, search, branching strategies
Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.187.9764
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.cornell.edu/gome... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.