A new lower bound for the linear knapsack problem with general integer variables.
Kamlesh MathurPrahalad VenkateshanPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- knapsack problem
- integer variables
- branch and bound algorithm
- lower bound
- optimal solution
- linear programming relaxation
- np hard
- objective function
- upper bound
- optimization problems
- branch and bound
- special case
- network design problem
- dynamic programming
- mixed integer
- continuous relaxation
- continuous variables
- lower and upper bounds
- lagrangian relaxation
- cutting plane
- greedy algorithm
- combinatorial optimization
- production planning
- evolutionary algorithm