{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T00:44:34Z","timestamp":1778633074342,"version":"3.51.4"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031086229","type":"print"},{"value":"9783031086236","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08623-6_8","type":"book-chapter","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:06:24Z","timestamp":1661756784000},"page":"45-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Semidefinite Approach for\u00a0the\u00a0Single Row Facility Layout Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4380-2778","authenticated-orcid":false,"given":"Jan","family":"Schwiddessen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2008.06.002","volume":"157","author":"ARS Amaral","year":"2009","unstructured":"Amaral, A.R.S.: A new lower bound for the single row facility layout problem. Discret. Appl. Math. 157(1), 183\u2013190 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.disopt.2005.03.001","volume":"2","author":"MF Anjos","year":"2005","unstructured":"Anjos, M.F., Kennings, A., Vannelli, A.: A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discret. Optim. 2(2), 113\u2013122 (2005)","journal-title":"Discret. Optim."},{"key":"8_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"MM Deza","year":"2009","unstructured":"Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics, vol. 15. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04295-9"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47\u201363 (1974)","DOI":"10.1145\/800119.803884"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Williamson, D.P.: .878-approximation algorithms for MAX CUT and MAX 2SAT. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 422\u2013431 (1994)","DOI":"10.1145\/195058.195216"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/opre.36.2.258","volume":"36","author":"SS Heragu","year":"1988","unstructured":"Heragu, S.S., Kusiak, A.: Machine layout problem in flexible manufacturing systems. Oper. Res. 36(2), 258\u2013268 (1988)","journal-title":"Oper. Res."},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-012-9505-8","volume":"55","author":"P Hungerl\u00e4nder","year":"2012","unstructured":"Hungerl\u00e4nder, P., Rendl, F.: A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. 55(1), 1\u201320 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10107-012-0627-7","volume":"140","author":"P Hungerl\u00e4nder","year":"2013","unstructured":"Hungerl\u00e4nder, P., Rendl, F.: Semidefinite relaxations of ordering problems. Math. Program. 140(1), 77\u201397 (2013)","journal-title":"Math. Program."},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3005345","volume":"43","author":"N Krislock","year":"2017","unstructured":"Krislock, N., Malick, J., Roupin, F.: BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems. ACM Trans. Math. Softw. (TOMS) 43(4), 1\u201323 (2017)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10107-012-0628-6","volume":"140","author":"J Malick","year":"2013","unstructured":"Malick, J., Roupin, F.: On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0\u20131 quadratic problems leading to quasi-newton methods. Math. Program. 140(1), 99\u2013124 (2013)","journal-title":"Math. Program."},{"issue":"16","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1016\/j.dam.2010.07.005","volume":"158","author":"S Sanjeevi","year":"2010","unstructured":"Sanjeevi, S., Kianfar, K.: A polyhedral study of triplet formulation for single row facility layout problem. Discret. Appl. Math. 158(16), 1861\u20131867 (2010)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08623-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:07:24Z","timestamp":1661756844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08623-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031086229","9783031086236"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08623-6_8","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"value":"2731-040X","type":"print"},{"value":"2731-0418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.or2021.unibe.ch\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}