An integer linear optimization model to the compartmentalized knapsack problem.
Osvaldo InarejosRobinson HotoNelson MaculanPublished in: Int. Trans. Oper. Res. (2019)
Keyphrases
- knapsack problem
- optimization model
- integer variables
- continuous relaxation
- optimization process
- combinatorial optimization problems
- decision variables
- dynamic programming
- optimal solution
- optimization problems
- exact algorithms
- greedy algorithm
- bicriteria
- construction project
- heuristic solution
- multidimensional knapsack problem
- np hard
- integer arithmetic
- multiple objectives
- linear programming relaxation
- network flow
- np hard problems
- randomly generated test instances
- computational complexity
- greedy heuristic
- vehicle routing problem
- quadratic programming
- sensitivity analysis
- constraint satisfaction problems