The Knapsack Problem with Three Practical Constraints

This paper considers practical constraints for the unconstrained knapsack problem in its two-dimensional version, using integer programming. We first present an integer formulation for this knapsack problem, so couple constraints related with load balance, vertical (cargo) stability and fragility of the items also called load bearing. Using C language and the CPLEX solver, good results are obtained in an acceptable runtime considering instances from the literature.