Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/MIS.2009.25 | Intelligent Systems, IEEE |
Keywords | Field | DocType |
constraint handling,problem solving,scheduling,Gecode,SweConsNet,Sweden,constraint programming,Gecode,SICStus Prolog,Sweden,constraint programming,constraint-based local search | Constraint satisfaction,Mathematical optimization,Job shop scheduling,Scheduling (computing),Computer science,Constraint programming,Facility location problem,Processor scheduling,Software requirements specification,Constrained optimization | Journal |
Volume | Issue | ISSN |
24 | 2 | 1541-1672 |
Citations | PageRank | References |
10 | 0.97 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre Flener | 1 | 533 | 50.28 |
| Mats Carlsson | 2 | 975 | 79.24 |
| Christian Schulte | 3 | 387 | 33.89 |