Author:
Hamiez Jean-Philippe,Robet Julien,Hao Jin-Kao
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. European Journal of Operational Research 183(3), 1109–1130 (2007)
2. Dowsland, K., Dowsland, W.: Packing problems. European Journal of Operational Research 56(1), 2–14 (1992)
3. Sweeney, P., Ridenour Paternoster, E.: Cutting and packing problems: A categorized, application-orientated research bibliography. Journal of the Operational Research Society 43(7), 691–706 (1992)
4. Fowler, R., Paterson, M., Tanimoto, S.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12(3), 133–137 (1981)
5. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completness. W.H. Freeman and Company, San Francisco (1979)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献