10 search results - page 1 / 2 » Solving the Multidimensional Knapsack Problem Using an Evolu... |
IWINAC
2005
Springer
13 years 10 months ago
2005
Springer
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
EVOW
2007
Springer
13 years 11 months 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...
ISAAC
1992
Springer
13 years 9 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...