SAS/OR® 12.1 User's Guide: Constraint Programming

Documents the CLP procedure, which enables you to model and solve constraint satisfaction problems (CSPs) via finite domain constraint programming. PROC CLP includes an expressive syntax for describing and solving both general CSPs and activity scheduling problems; it also provides flexible tools for accurate modeling along with strategies and controls for guiding the search-oriented solution process. For the reader, some prior experience with constraint programming and constraint satisfaction problems is helpful but not essential.