A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem.
Alexandre Salles da CunhaLaura BahienseAbilio LucenaCid Carvalho de SouzaPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- knapsack problem
- branch and bound algorithm
- optimal solution
- lagrangian relaxation
- np hard
- branch and bound
- test problems
- lower bound
- combinatorial optimization problems
- lower bounding
- precedence constraints
- objective function
- linear program
- randomly generated problems
- linear programming relaxation
- linear programming
- exact algorithms
- production planning
- feasible solution
- search space
- solution quality
- mixed integer linear programming
- upper bounding
- integer variables
- single machine scheduling problem
- relaxation algorithm
- multidimensional knapsack problem
- upper bound
- heuristic methods
- optimization problems
- metaheuristic
- combinatorial problems
- randomly generated test instances
- column generation
- special case
- cutting plane
- network design problem
- max sat
- lower and upper bounds
- integer programming
- cost function
- combinatorial optimization
- finding an optimal solution
- maximum profit
- np complete