13376 search results - page 542 / 2676 » Problem Solving with |
185
click to vote
KBS
2007
15 years 7 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
180
Voted
ESOP
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
175
Voted
CP
2005
Springer
16 years 29 days 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...
164
Voted
CPAIOR
2004
Springer
16 years 25 days ago
2004
Springer
We describe using Case Based Reasoning to explore structure at the instance level as a means to distinguish whether to use CP or IP to solve instances of the Bid Evaluation Problem...
199
Voted
CCO
2001
Springer
15 years 12 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...