Constraint Programming in Sweden
Pierre Flener, Mats Carlsson, Christian Schulte.
Many important problems must be solved by intelligent search - for example, problems in scheduling, rostering, configuration, facility location, biology, finance, circuit layout, and hard/software specification checking. Constraint programming (CP) is rapidly becoming the method of choice in some areas, such as scheduling and configuration. A major difficulty lies in accelerating such (optimal) choices. This ranges from problem modeling to actual problem solving. Real-world success stories abound. Here, we survey CP research and development in Sweden.
In: IEEE Intelligent Systems 24(2), pages 87-89. IEEE Press, March/April, 2009. DOI 10.1109/MIS.2009.25.