Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions.
Jella PfeifferFranz RothlaufPublished in: OR (2007)
Keyphrases
- greedy heuristics
- multi unit combinatorial auctions
- multidimensional knapsack problem
- evolutionary algorithm
- scheduling problem
- evolutionary strategy
- tabu search
- knapsack problem
- set cover
- crossover operator
- genetic algorithm
- combinatorial auctions
- evolutionary computation
- multi objective
- greedy algorithm
- differential evolution
- optimization problems
- np hard
- multiple choice
- computational complexity
- multi objective optimization
- approximation algorithms
- feasible solution
- genetic programming