Modified shuffled frog leaping algorithm with integer mutation applied to the bounded knapsack problem
The knapsack problem or rucksack problem is a problem in combinatorial optimization. It has been studied for centuries as it is the simplest prototype of a maximization problem. The term knapsack problem invokes of the backpacker who is constrained by a fixed-sized knapsack and so must fill it only...
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit |
| Sprache: | English |
| Veröffentlicht: |
2010
|
| Schlagworte: |