146 search results - page 11 / 30 » A hybrid constraint programming approach to the log-truck sc... |
CP
2005
Springer
15 years 3 months ago
2005
Springer
One of the critical problems in the call center industries is the staffing problem since they must face variable demands and because staff costs represent a major part of the cost...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...