[1]Miehel G, Gilbert L, Ferderie S. Heuristics and lower bounds for the bin packing problem with confiicts[J]. Computers & Operations Reseacrh,2004,41(31):347-358 .
[2]Porsenjit B, Pat M. Antoine V packing two disks into a Polygonal environment[J]. Journal of Diserete Algorithms,2004,(2):373-80.
[3]Christofides N.An algorithm for two-dimensional cutting problems[J]. Computers & Operations Research, 1977, 25 (1):30-40.
[4]Kennedy J, Eberhart R C, Shi Y. Swarm Intelligence[M].San Francisoco: Mogan Kaufmann Publishers, 2001.
[5]Wang P T. Two algorithm for constrained two-dimensional cutting stock problems[J]. Computers & Operations Research, 1983, 31 (3): 573-586.
[6]Kocarev L, Jak Imosk I G. Logistic map as a block encryption algorithm [J].Physics Letters
A, 2001,289(4-5):199-206.
|