Sciweavers

13 search results - page 1 / 3
» Handbook of Approximation Algorithms and Metaheuristics
Sort
View
EMO
2009
Springer
219views Optimization» more  EMO 2009»
14 years 5 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 3 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
ICANNGA
2007
Springer
141views Algorithms» more  ICANNGA 2007»
14 years 5 months ago
On Sum Coloring of Graphs with Parallel Genetic Algorithms
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
Zbigniew Kokosinski, Krzysztof Kwarciany
EVOW
2006
Springer
14 years 2 months ago
The Core Concept for the Multidimensional Knapsack Problem
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
Jakob Puchinger, Günther R. Raidl, Ulrich Pfe...