A mixed-integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority.
Igor DeplanoCharly LersteauTrung Thanh NguyenPublished in: Int. Trans. Oper. Res. (2021)
Keyphrases
- mixed integer
- continuous relaxation
- knapsack problem
- linear model
- optimal solution
- integer variables
- cutting plane
- linear program
- binary variables
- linear programming problems
- lot sizing
- mixed integer programming
- valid inequalities
- combinatorial optimization problems
- convex hull
- dynamic programming
- feasible solution
- np hard
- least squares
- optimization problems
- implicit enumeration
- continuous variables
- greedy algorithm
- network design problem
- exact algorithms
- linear programming relaxation
- combinatorial optimization
- decision variables
- regression model
- lower bound
- linear programming
- quadratic program
- objective function
- lp relaxation
- constraint programming
- branch and bound
- neural network
- branch and bound algorithm