SAS/OR 9.1 User's Guide: Constraint Programming

This title serves as the primary documentation for the constraint programming capabilities in SAS/OR software. Experimental in 9.1, the CLP procedure is a finite domain constraint programming solver for solving constraint satisfaction problems (CSPs). The CLP procedure provides you with an expressive syntax with a choice of interfaces for accurate and flexible modeling, linear, logical, global, and scheduling constraints with powerful consistency routines, strategies for selection and assignment of variables and activities, and controls for guiding the search mechanism. This title serves as a reference guide for users of the constraint programming capabilities in SAS/OR software.