Author:
Bennell J.,Scheithauer G.,Stoyan Y.,Romanova T.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference22 articles.
1. Bennell, J. A., & Song, X. (2008). A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Computers and Operational Research, 35(1), 267–281.
2. Burke, E. K., Hellier, R. S. R., Kendall, G., & Whitwell, G. (2007). Complete and robust no-fit polygon generation for the irregular stock cutting problem. European Journal of Operational Research, 179(1), 27–49.
3. Culberson, J. C., & Reckhow, R. A. (1988). Covering polygons is hard. In Proceedings of 29th IEEE conference on foundations of computer science (pp. 601–611).
4. Cunninghame-Green, R. (1989). Geometry. Shoemaking and the milk tray problem. New Scientist, 1677, 50–53.
5. Daniels, K., & Inkulu, R. (2001). Translational polygon covering using intersection graphs. In Proceedings of the thirteenth Canadian conference on computational geometry (pp. 61–64).
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献