16504 search results - page 197 / 3301 » New Problems, New Solutions |
220
click to vote
ANTSW
2010
Springer
15 years 4 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
160
click to vote
KI
2006
Springer
15 years 6 months ago
2006
Springer
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
176
click to vote
EVOW
2007
Springer
16 years 20 days ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
171
click to vote
AE
2005
Springer
16 years 2 days ago
2005
Springer
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
165
click to vote
EOR
2006
15 years 6 months ago
2006
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...