K. K. Lai-andw and . Chan, Anevolutionary algorithm for the rectangular cutting stock problem, International Journal of Industrial Engineering, vol.4, pp.130-139, 1997.

Y. Cui, Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors, European Journal of Operational Research, vol.169, issue.1, pp.30-40, 2006.
DOI : 10.1016/j.ejor.2004.05.023

Y. Cui, A cutting stock problem and its solution in the manufacturing industry of large electric generators, Computers & Operations Research, vol.32, issue.7, pp.1709-1721, 2005.
DOI : 10.1016/j.cor.2003.11.022

T. Kampke, Simulated annealing: Use of a new tool in bin packing, Annals of Operations Research, vol.30, issue.1, pp.327-332, 1988.
DOI : 10.1007/BF02283751

H. Dyckhoff, A typology of cutting and packing problems, European Journal of Operational Research, vol.44, issue.2, pp.45-159, 1990.
DOI : 10.1016/0377-2217(90)90350-K

D. Suterf and . Chen, Fastevaluationofvector splinesin three dimensions, Computing

E. Falkenauer, A hybrid grouping genetic algorithm for bin packing, Journal of Heuristics, vol.22, issue.2, pp.5-30, 1996.
DOI : 10.1007/BF00226291

D. Delahaye, J. Alliot, J. , M. Schoenauer, and J. L. Farges, Genetic algorithms partitioning airspace, Proceeding of theTenth IEEE Conference on Articial Intelligence Application. IEEE, 1994.
URL : https://hal.archives-ouvertes.fr/hal-01205264

D. Delahaye, Spatial Evolutionary Modelling (chapter 7), 2001.

D. Delahaye and S. Puechmorel, Air traffic complexity based on non linear dynamical systems, Proceeding of the 5thATM Seminar.FAA/EUROCONTROL, 2003.
DOI : 10.1109/cdc.2010.5718004
URL : https://hal.archives-ouvertes.fr/hal-00938403

C. K. Cheng, The optimal partitioning of networks, Networks, vol.23, issue.3, pp.297-315, 1992.
DOI : 10.1002/net.3230220307

E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines Wiley and sons, pp.0-471, 1989.