Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm.
Amira GherboudjAbdesslem LayebSalim ChikhiPublished in: Int. J. Bio Inspired Comput. (2012)
Keyphrases
- knapsack problem
- search algorithm
- randomly generated test instances
- implicit enumeration
- binary variables
- continuous relaxation
- combinatorial optimization problems
- test problems
- linear relaxation
- dynamic programming
- optimization problems
- distributed constraint satisfaction problems
- np hard
- bicriteria
- production planning
- exact algorithms
- cutting plane
- optimal solution
- maximum profit
- linear programming relaxation
- greedy algorithm
- branch and bound
- integer variables
- tabu search
- neural network
- combinatorial optimization
- heuristic search
- exact solution
- benchmark problems
- cost function
- search algorithm for solving