{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:03:16Z","timestamp":1742983396043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319007946"},{"type":"electronic","value":"9783319007953"}],"license":[{"start":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T00:00:00Z","timestamp":1385596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T00:00:00Z","timestamp":1385596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-00795-3_40","type":"book-chapter","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T03:50:39Z","timestamp":1385524239000},"page":"275-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Exact Approach for the Combined Cell Layout Problem"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Hungerl\u00e4nder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel F.","family":"Anjos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,28]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Chu, C-H.: Recent advances in mathematical programming for cell formation. In: Planning, Design, and Analysis of Cellular Manufacturing Systems, number 24 in Manufacturing Research and Technology, pp. 3\u201346. Elsevier Science B.V. (1995)","DOI":"10.1016\/S1572-4417(06)80034-3"},{"issue":"2","key":"40_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/opre.29.2.371","volume":"29","author":"J-C 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":"2","key":"40_CR3","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."},{"key":"40_CR4","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, 812\u2013826 (1969)","journal-title":"Oper. Res."},{"issue":"3","key":"40_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0305-0548(91)90027-O","volume":"18","author":"J Suryanarayanan","year":"1991","unstructured":"Suryanarayanan, J., Golden, B., Wang, Q.: A new heuristic for the linear placement problem. Comput. Oper. Res. 18(3), 255\u2013262 (1991)","journal-title":"Comput. Oper. Res."},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Hungerl\u00e4nder, P.: A semidefinite optimization approach to the directed circular facility layout problem. Technical report, submitted (2012)","DOI":"10.3182\/20130619-3-RU-3018.00509"},{"key":"40_CR7","unstructured":"Tucker, A.W.: On directed graphs and integer programs. Technical report, IBM Mathematical Research Project (1960)"},{"issue":"2","key":"40_CR8","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TCT.1963.1082116","volume":"10","author":"DH Younger","year":"1963","unstructured":"Younger, D.H.: Minimum feedback arc sets for a directed graph. IEEE Trans. Circuit Theory 10(2), 238\u2013245 (1963)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"2","key":"40_CR9","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. Discrete Optim. 2(2), 113\u2013122 (2005)","journal-title":"Discrete Optim."},{"issue":"1","key":"40_CR10","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1287\/ijoc.1090.0318","volume":"22","author":"C Buchheim","year":"2010","unstructured":"Buchheim, C., Wiegele, A., Zheng, L.: Exact algorithms for the quadratic linear ordering problem. INFORMS J. Comput. 22(1), 168\u2013177 (2010)","journal-title":"INFORMS J. Comput."},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"M. Chimani and P. Hungerl\u00e4nder. Exact approaches to multi-level vertical orderings. INFORMS Journal on Computing. accepted, preprint available at www.ae.uni-jena.de\/Research_Pubs\/MLVO.html (2012)","DOI":"10.1287\/ijoc.1120.0525"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Chimani, M., Hungerl\u00e4nder, P.: Multi-level verticality optimization: Concept, strategies, and drawing scheme. J. Graph Algorithms Appl. Accepted, preprint available at www.ae.uni-jena.de\/Research_Pubs\/MLVO.html (2012)","DOI":"10.7155\/jgaa.00296"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Chimani, M., Hungerl\u00e4nder, P., J\u00fcnger, M., Mutzel, P.: An SDP approach to multi-level crossing minimization. In: Proceedings of Algorithm Engineering and Experiments [ALENEX\u20192011] (2011)","DOI":"10.1145\/2133803.2330084"},{"key":"40_CR14","unstructured":"Hungerl\u00e4nder, P.: Semidefinite approaches to ordering problems. PhD thesis, Alpen-Adria Universit\u00e4t Klagenfurt (2012)"},{"issue":"1","key":"40_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0377-2217(97)00062-3","volume":"108","author":"BC Tansel","year":"1998","unstructured":"Tansel, B.C., Bilen, C.: Move based heuristics for the unidirectional loop network layout problem. Eur. J. Oper. Res. 108(1), 36\u201348 (1998)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00795-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T07:14:47Z","timestamp":1676358887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00795-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,28]]},"ISBN":["9783319007946","9783319007953"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00795-3_40","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2013,11,28]]},"assertion":[{"value":"28 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}