Constraint Satisfaction

The Constraint Satisfaction Problem (CSP) describes a general framework for problems in which values must be assigned to a set of variables subject to specific constraints. Widely studied in academia for several decades, research in this field is successfully beginning to penetrate mainstream industry. With the advent of the modern computer contributing to the significant growth of this field, Constraint Satisfaction research is being applied to numerous industrial problems, including:

• Vehicle Routing
• Resource Scheduling
• Staff Rostering
• Software Verification
• Supply Chain Management
• Equity Portfolio Optimisation
• Inventory Management
• Financial Forecasting
• Car Sequencing

XCSP Format

The Constraint Satisfaction Problem (CSP) describes a general framework for problems in which values must be assigned to a set of variables subject to specific constraints.

XCSP is an XML specification to represent a wide range of Constraint Satisfaction Problems (CSP). The XCSP format is described in detail here.

Satalia solves CSP problems. Simply upload your XCSP files (with extension .xml) to our SolveEngine using our API or Web-Poral, and let Satalia do the solving.