Exact algorithms for the two-dimensional guillotine knapsack

@article{Dolatabadi2012ExactAF,
  title={Exact algorithms for the two-dimensional guillotine knapsack},
  author={Mohammad Dolatabadi and Andrea Lodi and Michele Monaci},
  journal={Computers & OR},
  year={2012},
  volume={39},
  pages={48-53}
}
The two-dimensional knapsack problem requires to pack a maximum profit subset of ‘‘small’’ rectangular items into a unique ‘‘large’’ rectangular sheet. Packing must be orthogonal without rotation, i.e., all the rectangle heights must be parallel in the packing, and parallel to the height of the sheet. In addition, we require that each item can be unloaded from the sheet in stages, i.e., by unloading simultaneously all items packed at the same either y or x coordinate. This corresponds to use… CONTINUE READING
8 Citations
32 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…