Multivariable Branching: A 0-1 Knapsack Problem Case Study.
Yu YangNatashia BolandMartin W. P. SavelsberghPublished in: INFORMS J. Comput. (2021)
Keyphrases
- knapsack problem
- case study
- combinatorial optimization problems
- optimal solution
- dynamic programming
- optimization problems
- branch and bound
- test problems
- input output
- multidimensional knapsack problem
- linear programming relaxation
- randomly generated test instances
- exact algorithms
- np hard
- greedy algorithm
- heuristic solution
- cutting plane
- np hard problems
- software development
- real world
- multiple objectives
- evolutionary algorithm
- decision variables
- maximum profit
- continuous relaxation
- greedy heuristic
- branch and bound algorithm
- transfer function
- search space
- vehicle routing problem