Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

IWINAC
2005
Springer

favoriteEmaildiscussreport

166views Artificial Intelligence» more IWINAC 2005»

Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound

13 years 10 months ago

Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound

Download www.lcc.uma.es

José E. Gallardo, Carlos Cotta, Antonio J.

Real-time Traffic

IWINAC 2005 |

claim paper

Related Content

» A hybrid model of evolutionary algorithms and branchandbound for combinatorial optimizatio...

» Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constra...

» Generalized Assignment Problems

» Multicriteria Network Design Using Evolutionary Algorithm

» Hybridizing an evolutionary algorithm with mathematical programming techniques for multiob...

» Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in ...

» Experimental study of hybridtype distributed maximal constraint satisfaction algorithm

» Extracting Stellar Population Parameters of Galaxies from Photometric Data Using Evolution...

» Reconstruction of Reticulate Networks from Gene Trees

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	IWINAC
Authors	José E. Gallardo, Carlos Cotta, Antonio J. Fernández

Comments (0)