DGSA: discrete gravitational search algorithm for solving knapsack problem.
Hedieh SajediSeyedeh Fatemeh RazaviPublished in: Oper. Res. (2017)
Keyphrases
- knapsack problem
- search algorithm for solving
- continuous relaxation
- combinatorial optimization problems
- optimal solution
- decision variables
- search algorithm
- test problems
- dynamic programming
- optimization problems
- lower bound
- np hard
- multidimensional knapsack problem
- linear programming relaxation
- scheduling problem
- multiple objectives
- exact algorithms
- greedy algorithm
- np hard problems
- tabu search
- heuristic solution
- bicriteria
- implicit enumeration
- neural network
- branch and bound
- maximum profit
- feasible solution
- binary variables