{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:38:28Z","timestamp":1742949508848,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030106911"},{"type":"electronic","value":"9783030106928"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10692-8_9","type":"book-chapter","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T13:53:20Z","timestamp":1547733200000},"page":"80-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subtraction of Two 2D Polygons with Some Matching Vertices"],"prefix":"10.1007","author":[{"given":"Georgi","family":"Evtimov","sequence":"first","affiliation":[]},{"given":"Stefka","family":"Fidanova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,18]]},"reference":[{"key":"9_CR1","unstructured":"Alvarez-Valdes, R., Parajon, A., Tamarit, J.M.: A computational study of heuristic algorithms for two-dimensional cutting stock problems. In: 4th Metaheuristics International Conference (MIC 2001), pp. 16\u201320 (2001)"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.ejor.2005.11.068","volume":"183","author":"R Alvarez-Valdes","year":"2007","unstructured":"Alvarez-Valdes, R., Parreno, F., Tamarit, J.M.: A Tabu Search algorithm for two dimensional non-guillotine cutting problems. Eur. J. Oper. Res. 183(3), 1167\u20131182 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ejor.2007.08.007","volume":"191","author":"G Cintra","year":"2008","unstructured":"Cintra, G., Miyazawa, F., Wakabayashi, Y., Xavier, E.: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur. J. Oper. Res. 191, 61\u201385 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-07644-7_7","volume-title":"Hybrid Metaheuristics","author":"F Dusberger","year":"2014","unstructured":"Dusberger, F., Raidl, G.R.: A variable neighborhood search using very large neighborhood structures for the 3-staged 2-dimensional cutting stock problem. In: Blesa, M.J., Blum, C., Vo\u00df, S. (eds.) HM 2014. LNCS, vol. 8457, pp. 85\u201399. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-07644-7_7"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.endm.2014.11.018","volume":"47","author":"F Dusberger","year":"2015","unstructured":"Dusberger, F., Raidl, G.R.: Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search. Electron. Notes Discrete Math. 47, 133\u2013140 (2015)","journal-title":"Electron. Notes Discrete Math."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-319-73441-5_37","volume-title":"Large-Scale Scientific Computing","author":"G Evtimov","year":"2018","unstructured":"Evtimov, G., Fidanova, S.: Heuristic algorithm for 2D cutting stock\u00a0problem. In: Lirkov, I., Margenov, S. (eds.) LSSC 2017. LNCS, vol. 10665, pp. 350\u2013357. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-73441-5_37"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.ejor.2005.11.062","volume":"183","author":"JF Gon\u00e7alves","year":"2007","unstructured":"Gon\u00e7alves, J.F.: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3), 1212\u20131229 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Parmar, K., Prajapati, H., Dabhi, V.: Cutting stock problem: a survey of evolutionary computing based solution. In: Proceedings of Green Computing Communication and Electrical Engineering (2014). \n                      https:\/\/doi.org\/10.1109\/ICGCCEE.2014.6921411","DOI":"10.1109\/ICGCCEE.2014.6921411"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discrete Appl. Math. 123, 379\u2013396 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Lin, Z., Li, Y.: An efficient algorithm for intersection, union and difference between two polygons. In: Proceedings of Computer Network and Multimedia Technology, Wuhan, China, pp. 1\u20134 (2009)","DOI":"10.1109\/CISE.2009.5364458"}],"container-title":["Lecture Notes in Computer Science","Numerical Methods and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10692-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T05:26:59Z","timestamp":1558330019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-10692-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030106911","9783030106928"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10692-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Methods and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Borovets","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nma2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nma18.fmi.uni-sofia.bg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}