Constraint Programming in Sweden

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.

Authors

• Pierre Flener
• Mats Carlsson
• Christian Schulte

Keywords

• Job shop scheduling
• Computer science
• Silicon carbide
• Processor scheduling
• Hybrid intelligent systems
• Intelligent structures
• Rail transportation
• Base stations
• Computer industry
• Industrial training
• Constraint Programming
• Research And Development
• Base Station
• Real-time Optimization
• Real-time Solution
• Uppsala University
• Lund University
• constraint-based local search
• Sweden
• SICStus Prolog
• Gecode