{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:02:28Z","timestamp":1774368148301,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030333935","type":"print"},{"value":"9783030333942","type":"electronic"}],"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-33394-2_11","type":"book-chapter","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:16:49Z","timestamp":1572441409000},"page":"131-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the One\u2013Dimensional Space Allocation Problem with Partial Order and Forbidden Zones"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8560-3446","authenticated-orcid":false,"given":"Gennady G.","family":"Zabudsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2709-9755","authenticated-orcid":false,"given":"Natalia S.","family":"Veremchuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D Adolphson","year":"1973","unstructured":"Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM J. Appl. Math. 25(3), 403\u2013423 (1973)","journal-title":"SIAM J. Appl. Math."},{"issue":"suppl. 1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1134\/S0081543814020084","volume":"284","author":"II Eremin","year":"2014","unstructured":"Eremin, I.I., Gimadi, E.K., Kel\u2019manov, A.V., Pyatkin, A.V., Khachai, M.Y.: 2-Approximation algorithm for finding a clique with minimum weight of vertices and edges. Proc. Steklov Inst. Math. 284(suppl. 1), 87\u201395 (2014). \n                    https:\/\/doi.org\/10.1134\/S0081543814020084","journal-title":"Proc. Steklov Inst. Math."},{"issue":"12","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1023\/B:AURC.0000008436.55858.41","volume":"64","author":"AI Erzin","year":"2003","unstructured":"Erzin, A.I., Cho, J.D.: Concurrent placement and routing in the design of integrated circuits. Automat. Remote Control 64(12), 1988\u20131999 (2003). \n                    https:\/\/doi.org\/10.1023\/B:AURC.0000008436.55858.41","journal-title":"Automat. Remote Control"},{"key":"11_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979). Mir, Moscow (1982)"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1134\/S0005117917030043","volume":"78","author":"YA Kochetov","year":"2017","unstructured":"Kochetov, Y.A., Panin, A.A., Plyasunov, A.V.: Genetic local search and hardness of approximation for the server load balancing problem. Automat. Remote Control 78(3), 425\u2013434 (2017). \n                    https:\/\/doi.org\/10.1134\/S0005117917030043","journal-title":"Automat. Remote Control"},{"issue":"suppl. 1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1134\/S0081543817090127","volume":"299","author":"MY Khachai","year":"2017","unstructured":"Khachai, M.Y., Neznakhina, E.D.: Approximation schemes for the generalized traveling salesman problem. Proc. Steklov Inst. Math. 299(suppl. 1), 97\u2013105 (2017). \n                    https:\/\/doi.org\/10.1134\/S0081543817090127","journal-title":"Proc. Steklov Inst. Math."},{"issue":"2","key":"11_CR7","first-page":"139","volume":"14","author":"RF Love","year":"1976","unstructured":"Love, R.F., Wong, J.Y.: On solving a one-dimensional space allocation problem with integer programming. INFOR 14(2), 139\u2013143 (1976)","journal-title":"INFOR"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"2937","DOI":"10.1016\/j.cor.2004.04.014","volume":"32","author":"G Miranda","year":"2005","unstructured":"Miranda, G., Luna, H.P.L., Mateus, G.R.R., Ferreira, P.M.: A performance quarantee heuristic for electronic components placement problems including thermal effects. Comput. Oper. Res. 32, 2937\u20132957 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1142\/S0218194093000240","volume":"3","author":"EA Mukhacheva","year":"1993","unstructured":"Mukhacheva, E.A., Zalgaller, V.A.: Linear programming cutting problems. Int. J. Softw. Eng. Knowl. Eng. 3(4), 463\u2013476 (1993)","journal-title":"Int. J. Softw. Eng. Knowl. Eng."},{"issue":"1","key":"11_CR10","first-page":"70","volume":"8","author":"AV Panyukov","year":"2001","unstructured":"Panyukov, A.V.: The problem of locating rectangular plants with minimal cost for the connecting network. Diskret. Anal. Issled. Oper. Ser. 2 8(1), 70\u201387 (2001)","journal-title":"Diskret. Anal. Issled. Oper. Ser. 2"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/opre.29.2.371","volume":"29","author":"JC Picard","year":"1981","unstructured":"Picard, J.C., Queyranne, M.: On the one-dimensional space allocation problem. Oper. Res. 29(2), 371\u2013391 (1981)","journal-title":"Oper. Res."},{"issue":"4","key":"11_CR12","first-page":"61","volume":"16","author":"AS Rudnev","year":"2009","unstructured":"Rudnev, A.S.: Probabilistic tabu search algorithm for the packing circles and rectangles into the strip. Diskret. Anal. Issled. Oper. 16(4), 61\u201386 (2009)","journal-title":"Diskret. Anal. Issled. Oper."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1016\/j.ejor.2005.08.029","volume":"179","author":"A Sarkar","year":"2006","unstructured":"Sarkar, A., Batta, R., Nagi, R.: Placing a finite size facility with a center objective on a rectangular plane with barriers. Eur. J. Oper. Res. 179(3), 1160\u20131176 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"11_CR14","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1287\/opre.17.5.812","volume":"17","author":"DM Simmons","year":"1969","unstructured":"Simmons, D.M.: One-dimensional space allocation: an ordering algorithm. Oper. Res. 17(5), 812\u2013826 (1969)","journal-title":"Oper. Res."},{"issue":"12","key":"11_CR15","first-page":"9","volume":"49","author":"GG Zabudsky","year":"2005","unstructured":"Zabudsky, G.G.: On the complexity of the problem of placement on a line with restrictions on minimum distanses. Russ. Math. (Iz. VUZ) 49(12), 9\u201312 (2005)","journal-title":"Russ. Math. (Iz. VUZ)"},{"issue":"1","key":"11_CR16","first-page":"61","volume":"7","author":"GG Zabudsky","year":"2000","unstructured":"Zabudsky, G.G.: On the problem of the linear ordering of vertices of parallel-sequential graphs. Diskret. Anal. Issled. Oper. 7(1), 61\u201364 (2000)","journal-title":"Diskret. Anal. Issled. Oper."},{"issue":"3","key":"11_CR17","first-page":"86","volume":"16","author":"GG Zabudskii","year":"2013","unstructured":"Zabudskii, G.G., Amzin, I.V.: Algorithms of compact location for technological equipment on parallel lines. Sib. Zh. Ind. Mat. 16(3), 86\u201394 (2013). (in Russian)","journal-title":"Sib. Zh. Ind. Mat."},{"issue":"11","key":"11_CR18","doi-asserted-by":"publisher","first-page":"1948","DOI":"10.1134\/S0965542510110175","volume":"50","author":"GG Zabudskii","year":"2010","unstructured":"Zabudskii, G.G., Lagzdin, A.Y.: Polynomial algorithms for solving the quadratic assignment problem on networks. Comput. Math. Math. Phys. 50(11), 1948\u20131955 (2010). \n                    https:\/\/doi.org\/10.1134\/S0965542510110175","journal-title":"Comput. Math. Math. Phys."},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1134\/S1990478916010154","volume":"10","author":"GG Zabudskii","year":"2016","unstructured":"Zabudskii, G.G., Veremchuk, N.S.: An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps. J. Appl. Ind. Math. 10(1), 136\u2013144 (2016). \n                    https:\/\/doi.org\/10.1134\/S1990478916010154","journal-title":"J. Appl. Ind. Math."},{"key":"11_CR20","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-93800-4_3","volume-title":"Optimization Problems and Their Applications","author":"GG Zabudsky","year":"2018","unstructured":"Zabudsky, G.G., Veremchuk, N.S.: Branch and bound method for the Weber problem with rectangular facilities on lines in the presence of forbidden gaps. In: Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds.) OPTA 2018. CCIS, vol. 871, pp. 29\u201341. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-93800-4_3"}],"container-title":["Communications in Computer and Information Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33394-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:21:25Z","timestamp":1572441685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33394-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030333935","9783030333942"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33394-2_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/motor2019.uran.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.34","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.64","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}