A Binary Fisherman Search Procedure for the 0/1 Knapsack Problem.
Carlos Alberto Cobos LozadaHernán DulceyJohny OrtegaMartha MendozaArmando OrdóñezPublished in: CAEPIA (2016)
Keyphrases
- knapsack problem
- search procedure
- binary variables
- optimal solution
- tabu search
- combinatorial optimization problems
- optimization problems
- search algorithm
- search space
- simulated annealing
- path relinking
- dynamic programming
- exact algorithms
- test problems
- np hard
- greedy algorithm
- bicriteria
- linear programming relaxation
- metaheuristic
- greedy heuristic
- search procedures
- multidimensional knapsack problem
- continuous relaxation
- neural network
- guided local search
- cutting plane
- hyper heuristics
- maximum profit
- linear programming
- implicit enumeration
- randomly generated test instances
- lp relaxation
- heuristic methods
- branch and bound
- scheduling problem