Exact and heuristic solution approaches for the mixed integer setup knapsack problem.
Nezih AltayPowell E. Robinson Jr.Kurt M. BretthauerPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- knapsack problem
- heuristic solution
- continuous relaxation
- mixed integer
- network design problem
- optimal solution
- feasible solution
- cutting plane
- exact algorithms
- np hard
- integer variables
- dynamic programming
- facility location
- optimization problems
- multidimensional knapsack problem
- mixed integer programming
- network design
- lot sizing
- convex hull
- linear program
- production planning
- lower bound
- branch and bound algorithm
- network flow problem
- vehicle routing problem
- greedy algorithm
- valid inequalities
- lp relaxation
- branch and bound
- linear programming
- cost function