16596 search results - page 231 / 3320 » Generalized Assignment Problems |
160
click to vote
JAIR
2007
15 years 6 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 ...
215
click to vote
ESE
2000
15 years 6 months ago
2000
Problem frames are a relatively new approach to requirements engineering, promising benefits not only in elicitation but also in subsequent design, by allowing their users to selec...
132
click to vote
ANOR
2007
15 years 6 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...
154
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
173
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...