Publisher
Zhejiang University Press
Reference9 articles.
1. Dowsland, K.A., Dowsland, W.B., 1992. Packing problems.European Journal of Operational Research,56(1):2–14.
2. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York.
3. Li, Z., Milenkovic, V.J., 1995. Compaction and separation algorithms for non-convex polygons and their applications.European Journal of Operational Research,84:539–561.
4. Liang, K.H., Yao, X., Newton, C., Hoffman, D., 2002. A new evolutionary approach to cutting stock problems with and without contiguity.Computers and Operations Research,29(12):1641–1659.
5. Lipnitskii, A.A., 2002. Use of genetic algorithms for solution of the rectangle packing problem.Cybernetics and Systems Analysis,38(6):943–946.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献