Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem.
Yanhong FengGai-Ge WangPublished in: IEEE Access (2018)
Keyphrases
- knapsack problem
- search algorithm
- dynamic programming
- binary variables
- combinatorial optimization problems
- test problems
- optimal solution
- np hard
- optimization problems
- exact algorithms
- linear programming relaxation
- markov decision processes
- greedy algorithm
- np hard problems
- search space
- multidimensional knapsack problem
- production planning
- branch and bound
- infinite horizon
- bicriteria
- satisfiability problem
- heuristic solution
- neural network
- heuristic search
- optimal policy
- implicit enumeration
- integer variables
- decision variables
- branch and bound algorithm
- constraint satisfaction
- tabu search
- genetic algorithm