2109 search results - page 83 / 422 » Solving Necklace Constraint Problems |
122
click to vote
CP
2005
Springer
15 years 10 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...
170
Voted
DAGSTUHL
2007
15 years 6 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
248
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
169
click to vote
ICAI
2010
15 years 2 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
130
click to vote
ICCD
2007
IEEE
16 years 1 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...