16596 search results - page 232 / 3320 » Generalized Assignment Problems |
150
Voted
DAM
2008
15 years 6 months ago
2008
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by B
199
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
183
click to vote
DISOPT
2010
15 years 6 months ago
2010
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
187
click to vote
CP
1997
Springer
15 years 10 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
149
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...