{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:33:23Z","timestamp":1743039203011,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319175089"},{"type":"electronic","value":"9783319175096"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-17509-6_7","type":"book-chapter","created":{"date-parts":[[2015,4,16]],"date-time":"2015-04-16T08:45:53Z","timestamp":1429173953000},"page":"95-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adjacency Variables Formulation for the Minimum Linear Arrangement Problem"],"prefix":"10.1007","author":[{"given":"Serigne","family":"Gueye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Michel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdi","family":"Moeini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,17]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2008.06.002","volume":"157","author":"A Amaral","year":"2009","unstructured":"Amaral, A.: A new lower bound for the single row facility layout problem. Discrete App. Math. 157, 183\u2013190 (2009)","journal-title":"Discrete App. Math."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.endm.2008.01.016","volume":"30","author":"A Amaral","year":"2008","unstructured":"Amaral, A., Caprara, A., Letchford, A., Gonzalez, J.: A new lower bound for the minimum linear arrangement of a graph. Electron. Notes Discrete Math. 30, 87\u201392 (2008)","journal-title":"Electron. Notes Discrete Math."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-03898-8_24","volume-title":"Parameterized and Exact Computation","author":"AE Mouawad","year":"2013","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 281\u2013294. Springer, Heidelberg (2013)"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1287\/ijoc.1040.0083","volume":"17","author":"A Caprara","year":"2005","unstructured":"Caprara, A., Gonzalez, J.: Laying out sparse graphs with provably minimum bandwidth. INFORMS J. Comput. 17(3), 356\u2013373 (2005)","journal-title":"INFORMS J. Comput."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Caprara, A., Letchford, A., Gonzalez, J.: Decorous lower bounds for minimum linear arrangement. INFORMS J. Comput. 23 (2010)","DOI":"10.1287\/ijoc.1100.0390"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s12532-011-0027-7","volume":"3","author":"A Caprara","year":"2011","unstructured":"Caprara, A., Oswald, M., Reinelt, G., Schwarz, R., Traversi, E.: Optimal linear arrangements using betweeness variables. Math Program. Comput. 3, 261\u2013280 (2011)","journal-title":"Math Program. Comput."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Deza, M., Laurent, M.: Geometry of cuts and metrics. In: Algorithms and Combinatorics, vol. 15. Springer, Heidelberg (1997)","DOI":"10.1007\/978-3-642-04295-9"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Stockmeyer, L.: Some simplified np-complete graph problems. Theoret. Comput. Sci. 1, 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Gueye, S., Michel, S., Yassine, A.: A 0\u20131 linear programming formulation for the berth assignment problem. In: IEEE LOGISTIQUA 2011, pp. 50\u201354 (2011)","DOI":"10.1109\/LOGISTIQUA.2011.5939402"},{"key":"7_CR10","first-page":"131","volume":"12","author":"LH Harper","year":"1961","unstructured":"Harper, L.H.: Optimal assignment of numbers to vertices. J. SIAM 12, 131\u2013135 (1961)","journal-title":"J. SIAM"},{"key":"7_CR11","unstructured":"Hendrickson, B., Leland, R.: The chaco user\u2019s guide, version 2.0. Technical report. SAND95-2344, Sandia National Laboratories (1995)"},{"key":"7_CR12","unstructured":"Horton, S.: The optimal linear arrangement problem: algorithms and approximation. Ph.D. Thesis, Georgia Institute of Technology (1997)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Hungerlaender, P., Rendl, F.: A computational study and survey of methods for the single-row facility layout problem. Technical report (2012)","DOI":"10.1007\/s10589-012-9505-8"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A Lisser","year":"2003","unstructured":"Lisser, A., Rendl, F.: Graph partitioning using linear and semidefinite programming. Math. Program., Ser. B 95, 91\u2013101 (2003)","journal-title":"Math. Program., Ser. B"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0166-218X(93)E0168-X","volume":"59","author":"W Liu","year":"1995","unstructured":"Liu, W., Vanelli, A.: Generating lower bounds for the linear arrangement problem. Discrete Appl. Math. 59, 137\u2013151 (1995)","journal-title":"Discrete Appl. Math."},{"key":"7_CR17","unstructured":"Petit, J.: Experiments on the minimum linear arrangement problem. Technical report (1999)"},{"key":"7_CR18","unstructured":"Schwarz, R.: A branch-and-cut algorithm with betweenness variables for the Linear arrangement problem. Ph.D. Thesis, Universitaet Heidelberg (2010)"}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17509-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:54:54Z","timestamp":1676015694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17509-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319175089","9783319175096"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17509-6_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}