1. Amossen RR. Constructive algorithms and lower bounds for guillotine cuttable orthogonal bin packing problems. Master's thesis, Department of Computer Science, University of Copenhagen, 2005.
2. A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem;Baldacci;European Journal of Operational Research,2007
3. Bediceanu N, Carlsson M. Sweep as a generic pruning technique applied to the non-overlapping rectangles constraints. In: Principles and Practice of Constraint Programming (CP’2001), vol. 2239, Springer, 2001. p. 377–91.
4. Sweep synchronization as a global propagation mechanism;Bediceanu;Computers and Operations Research,2006
5. Belov G. Problems, Models and algorithms in one- and two-dimensional cutting. PhD thesis, Technischen Universität Dresden, 2003.