Login / Signup

A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application.

Célia PaquayMichaël SchynsSabine Limbourg
Published in: Int. Trans. Oper. Res. (2016)
Keyphrases
  • three dimensional
  • lower bound
  • objective function
  • bayesian networks
  • upper bound
  • knapsack problem