A strong integer linear optimization model to the compartmentalized knapsack problem.
John J. Quiroga-OrozcoJosé M. Valério de CarvalhoRobinson S. V. HotoPublished in: Int. Trans. Oper. Res. (2019)
Keyphrases
- knapsack problem
- optimization model
- integer variables
- combinatorial optimization problems
- optimal solution
- continuous relaxation
- decision variables
- dynamic programming
- optimization process
- multidimensional knapsack problem
- optimization problems
- np hard problems
- integer arithmetic
- network flow
- bicriteria
- greedy algorithm
- exact algorithms
- linear programming relaxation
- np hard
- heuristic solution
- maximum profit
- greedy heuristic
- branch and bound algorithm
- evolutionary algorithm
- multiple objectives
- bayesian networks
- implicit enumeration
- linear programming
- supply chain
- upper bound