HIGHLIGHTS
- What: The authors theoretically compare integer programming models for the twodimensional two-staged knapsack problem. The authors show that the level packing model provides weaker linear programming (LP) relaxation bounds than pattern-based models. The authors discuss three integer programming models for the constrained 2DK: an extension of the level packing model, the strip packing model, and another pattern-based model adapted from the model for the 2DCS proposed by Mrad et_al . Before starting, the authors provide some formal definitions concerned with the 2DK.
- Who: Suho Kang from the Department of Industrial Engineering, Seoul National . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.