1. Aarts E, Lenstra JK (eds) (1997) Local search in combinatorial optimization. Wiley, New York
2. Art R (1966) An approach to the two-dimensional, irregular cutting stock problem. Technical Report 36.008, IBM Cambridge Centre
3. Barták R (1999) Constraint programming: in pursuit of the holy grail. In: Proceedings of the week of doctoral students (WDS99), Part IV, MatFyzPress, Prague, June 1999, pp. 555–564.
4. Beldiceanu N, Carlsson M (2001) Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh T (eds) CP’2001, int. conf. on principles and practice of constraint programming, vol 2239 of lecture notes in computer science. Springer, Pisa, pp 377–391
5. Beldiceanu N, Guo Q, Thiel S (2001) Non-overlapping constraints between convex polytopes. In: Walsh T (eds) CP’2001, int. conf. on principles and practice of constraint programming, vol 2239 of lecture notes in computer science. Springer, Pisa, pp 392–407