{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T10:19:43Z","timestamp":1779272383334,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,9,6]],"date-time":"2012-09-06T00:00:00Z","timestamp":1346889600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10589-012-9505-8","type":"journal-article","created":{"date-parts":[[2012,9,5]],"date-time":"2012-09-05T07:01:15Z","timestamp":1346828475000},"page":"1-20","source":"Crossref","is-referenced-by-count":84,"title":["A computational study and survey of methods for the single-row facility layout problem"],"prefix":"10.1007","volume":"55","author":[{"given":"Philipp","family":"Hungerl\u00e4nder","sequence":"first","affiliation":[]},{"given":"Franz","family":"Rendl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,6]]},"reference":[{"issue":"2","key":"9505_CR1","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1016\/j.ejor.2004.12.021","volume":"173","author":"A.R.S. Amaral","year":"2006","unstructured":"Amaral, A.R.S.: On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173(2), 508\u2013518 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9505_CR2","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1287\/opre.1080.0548","volume":"56","author":"A.R.S. Amaral","year":"2008","unstructured":"Amaral, A.R.S.: An exact approach to the one-dimensional facility layout problem. Oper. Res. 56(4), 1026\u20131033 (2008)","journal-title":"Oper. Res."},{"issue":"1","key":"9505_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.dam.2008.06.002","volume":"157","author":"A.R.S. Amaral","year":"2009","unstructured":"Amaral, A.R.S.: A new lower bound for the single row facility layout problem. Discrete Appl. Math. 157(1), 183\u2013190 (2009)","journal-title":"Discrete Appl. Math."},{"key":"9505_CR4","unstructured":"Amaral, A.R.S., Letchford, A.N.: A polyhedral approach to the single row facility layout problem (2011, in preparation). Preprint available from http:\/\/www.optimization-online.org\/DB_FILE\/2008\/03\/1931.pdf"},{"issue":"2","key":"9505_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.disopt.2005.03.001","volume":"2","author":"M.F. 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."},{"key":"9505_CR6","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Lasserre, J. (eds.): Handbook of Semidefinite, Conic and Polynomial Optimization International Series in Operations Research & Management Science. Springer, Berlin (2011, to appear)","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"9505_CR7","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Liers, F.: Global Approaches for facility layout and vlsi floorplanning. In: Anjos, M.F., Lasserre, J.B. (eds.): Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications (2012, to appear)","DOI":"10.1007\/978-1-4614-0769-0_29"},{"issue":"4","key":"9505_CR8","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/ijoc.1080.0270","volume":"20","author":"M.F. Anjos","year":"2008","unstructured":"Anjos, M.F., Vannelli, A.: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS J. Comput. 20(4), 611\u2013617 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"9505_CR9","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/10556780902917735","volume":"24","author":"M.F. Anjos","year":"2009","unstructured":"Anjos, M.F., Yen, G.: Provably near-optimal solutions for very large single-row facility layout problems. Optim. Methods Softw. 24(4), 805\u2013817 (2009)","journal-title":"Optim. Methods Softw."},{"key":"9505_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program. 36, 157\u2013173 (1986)","journal-title":"Math. Program."},{"key":"9505_CR11","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s10107-010-0377-3","volume":"124","author":"C. Buchheim","year":"2010","unstructured":"Buchheim, C., Liers, F., Oswald, M.: Speeding up ip-based algorithms for constrained quadratic 0-1 optimization. Math. Program. 124, 513\u2013535 (2010)","journal-title":"Math. Program."},{"key":"9505_CR12","doi-asserted-by":"crossref","unstructured":"Buchheim, C., Wiegele, A., Zheng, L.: Exact algorithms for the quadratic linear ordering problem. INFORMS J. Comput. 168\u2013177 (2009)","DOI":"10.1287\/ijoc.1090.0318"},{"key":"9505_CR13","volume-title":"Proceedings of Algorithm Engineering & Experiments [ALENEX\u20192011]","author":"M. Chimani","year":"2011","unstructured":"Chimani, M., Hungerl\u00e4nder, P., J\u00fcnger, M., Mutzel, P.: An SDP approach to multi-level crossing minimization. In: Proceedings of Algorithm Engineering & Experiments [ALENEX\u20192011] (2011)"},{"issue":"2","key":"9505_CR14","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.ejor.2011.03.034","volume":"213","author":"D. Datta","year":"2011","unstructured":"Datta, D., Amaral, A.R.S., Figueira, J.R.: Single row facility layout problem using a permutation-based genetic algorithm. Eur. J. Oper. Res. 213(2), 388\u2013394 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"9505_CR15","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"M.M. Deza","year":"1997","unstructured":"Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer, Berlin (1997)"},{"key":"9505_CR16","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10107-005-0661-9","volume":"105","author":"I. Fischer","year":"2006","unstructured":"Fischer, I., Gruber, G., Rendl, F., Sotirov, R.: Computational experience with a bundle method for semidefinite cutten plane relaxations of max-cut and equipartition. Math. Program. 105, 451\u2013469 (2006)","journal-title":"Math. Program."},{"key":"9505_CR17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/800119.803884","volume-title":"STOC\u201974: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing","author":"M.R. Garey","year":"1974","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: STOC\u201974: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, New York, pp. 47\u201363 (1974)"},{"key":"9505_CR18","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"9505_CR19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/A:1008982420344","volume":"11","author":"A. Alvarenga Gomes de","year":"2000","unstructured":"Gomes de Alvarenga, A., Negreiros-Gomes, F.J., Mestria, M.: Metaheuristic methods for a class of the facility layout problem. J. Intell. Manuf. 11, 421\u2013430 (2000)","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"9505_CR20","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"K.M. Hall","year":"1970","unstructured":"Hall, K.M.: An r-dimensional quadratic placement algorithm. Manag. Sci. 17(3), 219\u2013229 (1970)","journal-title":"Manag. Sci."},{"key":"9505_CR21","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/opre.13.3.388","volume":"13","author":"P. Hammer","year":"1965","unstructured":"Hammer, P.: Some network flow problems solved with pseudo-Boolean programming. Oper. Res. 13, 388\u2013399 (1965)","journal-title":"Oper. Res."},{"issue":"2","key":"9505_CR22","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0377-2217(92)90042-8","volume":"57","author":"S.S. Heragu","year":"1992","unstructured":"Heragu, S.S., Alfa, A.S.: Experimental analysis of simulated annealing based algorithms for the layout problem. Eur. J. Oper. Res. 57(2), 190\u2013202 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9505_CR23","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/opre.36.2.258","volume":"36","author":"S.S. 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":"9505_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(91)90088-D","volume":"53","author":"S.S. Heragu","year":"1991","unstructured":"Heragu, S.S., Kusiak, A.: Efficient models for the facility layout problem. Eur. J. Oper. Res. 53(1), 1\u201313 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"9505_CR25","volume-title":"Convex Analysis and Minimization Algorithms (vols. 1 and 2)","author":"J.-B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms (vols. 1 and 2). Springer, Berlin (1993)"},{"key":"9505_CR26","unstructured":"Hungerl\u00e4nder, P.: Exact approaches to ordering problems. Ph.D. thesis, Alpen-Adria Universit\u00e4t Klagenfurt (2011)"},{"key":"9505_CR27","unstructured":"Hungerl\u00e4nder, P., Rendl, F.: Semidefinite relaxations of ordering problems. Math. Program., Ser. B (2011, accepted). Preprint available at http:\/\/www.optimization-online.org\/DB_HTML\/2010\/08\/2696.html"},{"issue":"3","key":"9505_CR28","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1137\/0115060","volume":"15","author":"R.M. Karp","year":"1967","unstructured":"Karp, R.M., Held, M.: Finite-state processes and dynamic programming. SIAM J. Appl. Math. 15(3), 693\u2013718 (1967)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"9505_CR29","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(94)00062-H","volume":"87","author":"K.R. Kumar","year":"1995","unstructured":"Kumar, K.R., Hadjinicola, G.C., li Lin, T.: A heuristic procedure for the single-row facility layout problem. Eur. J. Oper. Res. 87(1), 65\u201373 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9505_CR30","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"9505_CR31","first-page":"139","volume":"14","author":"R.F. Love","year":"1967","unstructured":"Love, R.F., Wong, J.Y.: On solving a one-dimensional space allocation problem with integer programming. INFOR, Inf. Syst. Oper. Res. 14, 139\u2013143 (1967)","journal-title":"INFOR, Inf. Syst. Oper. Res."},{"issue":"2","key":"9505_CR32","doi-asserted-by":"crossref","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."},{"key":"9505_CR33","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"212","author":"F. Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 212, 307\u2013335 (2010)","journal-title":"Math. Program."},{"issue":"5","key":"9505_CR34","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0305-0548(90)90051-8","volume":"17","author":"D. Romero","year":"1990","unstructured":"Romero, D., S\u00e1nchez-Flores, A.: Methods for the one-dimensional space allocation problem. Comput. Oper. Res. 17(5), 465\u2013473 (1990)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9505_CR35","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ejor.2009.11.034","volume":"205","author":"H. Samarghandi","year":"2010","unstructured":"Samarghandi, H., Eshghi, K.: An efficient tabu algorithm for the single row facility layout problem. Eur. J. Oper. Res. 205(1), 98\u2013105 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9505_CR36","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1016\/j.dam.2010.07.005","volume":"158","author":"S. Sanjeevi","year":"2010","unstructured":"Sanjeevi, S., Kianfar, K.: Note: a polyhedral study of triplet formulation for single row facility layout problem. Discrete Appl. Math. 158, 1861\u20131867 (2010)","journal-title":"Discrete Appl. Math."},{"key":"9505_CR37","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1287\/opre.17.5.812","volume":"17","author":"D.M. Simmons","year":"1969","unstructured":"Simmons, D.M.: One-Dimensional space allocation: an ordering algorithm. Oper. Res. 17, 812\u2013826 (1969)","journal-title":"Oper. Res."},{"key":"9505_CR38","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/opre.19.1.249","volume":"19","author":"D.M. Simmons","year":"1971","unstructured":"Simmons, D.M.: A further note on one-dimensional space allocation. Oper. Res. 19, 249 (1971)","journal-title":"Oper. Res."},{"issue":"1","key":"9505_CR39","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C.D. Simone","year":"1990","unstructured":"Simone, C.D.: The cut polytope and the Boolean quadric polytope. Discrete Math. 79(1), 71\u201375 (1990)","journal-title":"Discrete Math."},{"issue":"3","key":"9505_CR40","doi-asserted-by":"crossref","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":"9505_CR41","volume-title":"Handbook of Semidefinite Programming","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic, Boston (2000)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9505-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9505-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9505-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T11:41:21Z","timestamp":1562154081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9505-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,6]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9505"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9505-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,6]]}}}