DocumentCode
1204437
Title
Constraint Programming in Sweden
Author
Flener, Pierre ; Carlsson, Mats ; Schulte, Christian
Author_Institution
Uppsala Univ., Uppsala
Volume
24
Issue
2
fYear
2009
Firstpage
87
Lastpage
89
Abstract
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.
Keywords
constraint handling; problem solving; scheduling; Gecode; SweConsNet; Sweden; constraint programming; Base stations; Computer industry; Computer science; Hybrid intelligent systems; Industrial training; Intelligent structures; Job shop scheduling; Processor scheduling; Rail transportation; Silicon carbide; Gecode; SICStus Prolog; Sweden; constraint programming; constraint-based local search;
fLanguage
English
Journal_Title
Intelligent Systems, IEEE
Publisher
ieee
ISSN
1541-1672
Type
jour
DOI
10.1109/MIS.2009.25
Filename
4804827
Link To Document