1026 search results - page 84 / 206 » An Optimal Solution to Room Search Problem |
161
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
177
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
145
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
158
click to vote
EOR
2006
15 years 6 months ago
2006
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
166
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...