Guided genetic algorithm for the multidimensional knapsack problem
- 10 May 2017
- journal article
- research article
- Published by Springer Nature in Memetic Computing
- Vol. 10 (1) , 29-42
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- A Shuffled Complex Evolution Algorithm For the Multidimensional Knapsack Problem2015
- A Self-guided Genetic Algorithm for permutation flowshop scheduling problemsComputers & Operations Research, 2012
- GARF: Towards Self-optimised Random ForestsLecture Notes in Computer Science, 2012
- Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic frameworkMemetic Computing, 2009
- Greedy algorithm for the general multidimensional knapsack problemAnnals of Operations Research, 2006
- Chromosome Reuse in Genetic AlgorithmsLecture Notes in Computer Science, 2003
- A Genetic Algorithm for the Multidimensional Knapsack ProblemJournal of Heuristics, 1998
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative DataMathematics of Operations Research, 1982
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- Discrete-Variable Extremum ProblemsOperations Research, 1957