A knapsack problem as a tool to solve the production planning problem in small foundries.
Victor Claudio Bento de CamargoLeandro MattiolliFranklina Maria Bragion ToledoPublished in: Comput. Oper. Res. (2012)
Keyphrases
- production planning
- knapsack problem
- mixed integer linear programming
- randomly generated test instances
- multi period
- continuous relaxation
- combinatorial optimization problems
- optimization problems
- optimal solution
- multidimensional knapsack problem
- mixed integer programming
- exact algorithms
- dynamic programming
- np hard
- production cost
- greedy algorithm
- cutting plane
- linear programming relaxation
- planning horizon
- greedy heuristic
- evolutionary algorithm
- neural network
- integer programming
- maximum profit