1. genetic algorithms (GA) were proposed for the 2D-SPP(two-dimensional strip packing problem) is suggested that works without any encoding of solutions.
2. to an increasing degree metaheuristics, mainly genetic algorithms (GA),but simulated annealing (SA), tabu search(TS) and other types of meta-heuristics are also applied.
3. GA from Bortfeldt and Gehring:
http://www.inf.utfsm.cl/~mcriff/Projet-SP/iori_martello_monaci.pdf
1. http://www.inf.utfsm.cl/~mcriff/SP/articulo1.pdf
2.http://en.wikipedia.org/wiki/Minimum_bounding_box_algorithms
3.http://www.fernuni-hagen.de/wirtschaftswissenschaft/download/beitraege/db426.pdf
4.http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.99.5620&rep=rep1&type=pdf