{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T07:18:00Z","timestamp":1772781480965,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10479-008-0456-5","type":"journal-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T16:35:46Z","timestamp":1225989346000},"page":"343-368","source":"Crossref","is-referenced-by-count":60,"title":["Tools of\u00a0mathematical modeling of\u00a0arbitrary object packing problems"],"prefix":"10.1007","volume":"179","author":[{"given":"J.","family":"Bennell","sequence":"first","affiliation":[]},{"given":"G.","family":"Scheithauer","sequence":"additional","affiliation":[]},{"given":"Y.","family":"Stoyan","sequence":"additional","affiliation":[]},{"given":"T.","family":"Romanova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"issue":"1","key":"456_CR1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.cor.2006.02.026","volume":"35","author":"J. A. Bennell","year":"2008","unstructured":"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\u2013281.","journal-title":"Computers and Operational Research"},{"issue":"1","key":"456_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2006.03.011","volume":"179","author":"E. K. Burke","year":"2007","unstructured":"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\u201349.","journal-title":"European Journal of Operational Research"},{"key":"456_CR3","doi-asserted-by":"crossref","unstructured":"Culberson, J. C., & Reckhow, R. A. (1988). Covering polygons is hard. In Proceedings of 29th IEEE conference on foundations of computer science (pp. 601\u2013611).","DOI":"10.1109\/SFCS.1988.21976"},{"key":"456_CR4","first-page":"50","volume":"1677","author":"R. Cunninghame-Green","year":"1989","unstructured":"Cunninghame-Green, R. (1989). Geometry. Shoemaking and the milk tray problem. New Scientist, 1677, 50\u201353.","journal-title":"New Scientist"},{"key":"456_CR5","unstructured":"Daniels, K., & Inkulu, R. (2001). Translational polygon covering using intersection graphs. In Proceedings of the thirteenth Canadian conference on computational geometry (pp. 61\u201364)."},{"key":"456_CR6","unstructured":"Daniels, K., Mathur, A., & Grinde, R. (2003). A combinatorial maximum cover approach to 2D translational geometric covering. In Proceeedings of 15th Canadian conference on computational geometry (pp. 2\u20135). Halifax, Nova Scotia, Canada, August 11\u201313, 2003."},{"key":"456_CR7","volume-title":"Homotopic topology","author":"A. Fomenko","year":"1986","unstructured":"Fomenko, A., Fuchs, D., & Gutenmacher, V. (1986). Homotopic topology. Akademiai Kiado: Budapest."},{"key":"456_CR8","first-page":"357","volume":"17","author":"P. K. Ghosh","year":"1991","unstructured":"Ghosh, P. K. (1991). An algebra of polygons through the notation of negative shapes. CVGIP: Imag Understand, 17, 357\u2013378.","journal-title":"CVGIP: Imag Understand"},{"key":"456_CR9","unstructured":"Scheithauer, G., Stoyan, Y., Gil, N., & Romanova, T. (2003). Phi-functions for circular segments. Prepr. Technische Univarsitat Dresden, MATH-NM-7-2003. Dresden."},{"key":"456_CR10","first-page":"67","volume-title":"Advances in CAD\/CAM\/\/","author":"Y. Stoyan","year":"1983","unstructured":"Stoyan, Y. (1983). Mathematical methods for geometric design. In Advances in CAD\/CAM\/\/. Proceeding PROLAMAT82. Leningrad, USSR, 16\u201318 May, 1982 (pp. 67\u201386). Amsterdam: North-Holland."},{"issue":"1","key":"456_CR11","first-page":"74","volume":"6","author":"Y. Stoyan","year":"2003","unstructured":"Stoyan, Y. (2003). Phi-function of non-convex polygons with rotations. Journal of Mechanical Engineering, 6(1), 74\u201386.","journal-title":"Journal of Mechanical Engineering"},{"key":"456_CR12","volume-title":"Methods and algorithms of placement of 2D geometric objects. Ukrainian SSR academy of sciences","author":"Y. Stoyan","year":"1976","unstructured":"Stoyan, Y., & Gil, N. (1976). Methods and algorithms of placement of 2D geometric objects. Ukrainian SSR academy of sciences. Kiev: Naukova Dumka (In Russian)."},{"key":"456_CR13","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/S0377-2217(98)00050-2","volume":"113","author":"Y. Stoyan","year":"1999","unstructured":"Stoyan, Y., & Pankratov, A. V. (1999). Regular packing of congruent polygons on the rectangular sheet. European Journal of Operational Research, 113, 653\u2013675.","journal-title":"European Journal of Operational Research"},{"key":"456_CR14","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/S0377-2217(99)00115-0","volume":"124","author":"Y. Stoyan","year":"2000","unstructured":"Stoyan, Y., & Patsuk, V. N. (2000). A method of optimal lattice packing of congruent oriented polygons in the plane. European Journal of Operational Research, 124, 204\u2013216.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"456_CR15","first-page":"888","volume":"A","author":"Y. Stoyan","year":"1977","unstructured":"Stoyan, Y., & Ponomarenko, L. D. (1977). Minkowski\u2019s sum and the hodograph of the dense allocation vector function. Reports of the Ukrainian SSR Academy of Science, A(10), 888\u2013890 (In Russian).","journal-title":"Reports of the Ukrainian SSR Academy of Science"},{"key":"456_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0377-2217(95)00038-0","volume":"92","author":"Y. Stoyan","year":"1996","unstructured":"Stoyan, Y., Novozhilova, M., & Kartashov, A. (1996). Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem. European Journal of Operational Research, 92, 193\u2013210.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"456_CR17","first-page":"1","volume":"2","author":"Y. Stoyan","year":"2002","unstructured":"Stoyan, Y., Terno, J., Scheithauer, G., Gil, N., & Romanova, T. (2002a). Phi-functions for primary 2D-objects. Studia Informatica Universalis, 2(1), 1\u201332.","journal-title":"Studia Informatica Universalis"},{"issue":"2","key":"456_CR18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.4064\/am29-2-6","volume":"29","author":"Y. Stoyan","year":"2002","unstructured":"Stoyan, Y., Terno, J., Gil, M., Romanova, T., & Scheithauer, G. (2002b). Construction of a Phi-function for two convex polytopes. Applicationes Mathematicae, 29(2), 199\u2013218.","journal-title":"Applicationes Mathematicae"},{"key":"456_CR19","first-page":"69","volume":"2","author":"Y. Stoyan","year":"2004","unstructured":"Stoyan, Y., Scheithauer, G., Gil, N., & Romanova, T. (2004). Phi-functions for complex 2D-objects. 4OR (Operations Research): Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2, 69\u201384.","journal-title":"4OR (Operations Research): Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"issue":"3","key":"456_CR20","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/s10559-005-0067-y","volume":"41","author":"Y. Stoyan","year":"2005","unstructured":"Stoyan, Y., Scheithauer, G., & Romanova, T. (2005a). Mathematical modeling of interaction of primary geometric 3D objects. Cybernetics and Systems Analysis, 41(3), 332\u2013342. Translated from Kibernetika i Sistemnyi Analiz, 3, 19\u201331.","journal-title":"Cybernetics and Systems Analysis"},{"issue":"2","key":"456_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1080\/02331930500050681","volume":"54","author":"Y. Stoyan","year":"2005","unstructured":"Stoyan, Y., Gil, N., Scheithauer, G., Pankratov, A., & Magdalina, I. (2005b). Packing of convex polytopes into a parallelepiped. Optimization, 54(2), 215\u2013235.","journal-title":"Optimization"},{"key":"456_CR22","volume-title":"Handbook of discrete and computational geometry","author":"G. F. Toth","year":"1997","unstructured":"Toth, G. F. (1997). Packing and covering. In J. Goodman & J. O\u2019Rourke (Eds.), Handbook of discrete and computational geometry. New York: CRC Press."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0456-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0456-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0456-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:51Z","timestamp":1559153271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0456-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,7]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["456"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0456-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,7]]}}}