465 search results - page 23 / 93 » On the Hardness of Range Assignment Problems |
128
Voted
JAIR
2007
15 years 3 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
99
Voted
ANOR
2007
15 years 3 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
118
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
142
Voted
CP
1997
Springer
15 years 7 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 ...
130
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...