A Solution to the Strongly Correlated 0-1 Knapsack Problem by a Binary Branch and Bound Algorithm.
José Crispín Zavala DíazJorge A. Ruiz-VanoyeOcotlán Díaz-ParraJosé A. Hernández-AguilarPublished in: CSO (2012)
Keyphrases
- knapsack problem
- optimal solution
- branch and bound algorithm
- strongly correlated
- integer variables
- np hard
- test problems
- branch and bound
- lower bound
- combinatorial optimization problems
- linear programming
- greedy heuristic
- linear programming relaxation
- lower bounding
- solution quality
- objective function
- production planning
- lagrangian relaxation
- precedence constraints
- linear program
- decision variables
- multidimensional knapsack problem
- upper bounding
- search space
- branch and bound method
- metaheuristic
- mixed integer linear programming
- cutting plane
- feasible solution
- exact algorithms
- finding an optimal solution
- upper bound
- continuous relaxation
- single machine scheduling problem
- randomly generated problems
- exact solution
- mixed integer
- heuristic methods
- combinatorial optimization
- efficient solutions
- max sat
- network design problem
- optimization problems
- dynamic programming
- neural network
- column generation
- integer programming
- implicit enumeration
- greedy algorithm
- simulated annealing
- learning algorithm