{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:52:26Z","timestamp":1782485546597,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T00:00:00Z","timestamp":1770854400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T00:00:00Z","timestamp":1770854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008131","name":"Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008131","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s11590-026-02282-0","type":"journal-article","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T09:59:32Z","timestamp":1770890372000},"page":"1299-1315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Facet-defining triangle inequalities for the quadratic linear ordering problem"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5335-0678","authenticated-orcid":false,"given":"Sven","family":"Mallach","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,12]]},"reference":[{"issue":"1","key":"2282_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-012-9505-8","volume":"55","author":"P Hungerl\u00e4nder","year":"2013","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 (2013). https:\/\/doi.org\/10.1007\/s10589-012-9505-8","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2282_CR2","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). https:\/\/doi.org\/10.1287\/opre.36.2.258","journal-title":"Oper. Res."},{"issue":"3","key":"2282_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0305-0548(91)90027-O","volume":"18","author":"JK Suryanarayanan","year":"1991","unstructured":"Suryanarayanan, J.K., Golden, B.L., Wang, Q.: A new heuristic for the linear placement problem. Comput. Oper. Res. 18(3), 255\u2013262 (1991). https:\/\/doi.org\/10.1016\/0305-0548(91)90027-O","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2282_CR4","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). https:\/\/doi.org\/10.1007\/s10107-012-0627-7","journal-title":"Math. Program."},{"issue":"1","key":"2282_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Ind. Appl. Math. 12(1), 131\u2013135 (1964). https:\/\/doi.org\/10.1137\/0112012","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"2282_CR6","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). https:\/\/doi.org\/10.1287\/ijoc.1090.0318","journal-title":"INFORMS J. Comput."},{"key":"2282_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2023.106449","volume":"161","author":"E Gaar","year":"2024","unstructured":"Gaar, E., Puges, D., Wiegele, A.: Strong SDP based bounds on the cutwidth of a graph. Comput. Oper. Res. 161, 1\u201311 (2024). https:\/\/doi.org\/10.1016\/j.cor.2023.106449","journal-title":"Comput. Oper. Res."},{"key":"2282_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejco.2023.100071","volume":"11","author":"S Mallach","year":"2023","unstructured":"Mallach, S.: Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem. EURO J. Comput. Optim. 11, 1\u201321 (2023). https:\/\/doi.org\/10.1016\/j.ejco.2023.100071","journal-title":"EURO J. Comput. Optim."},{"key":"2282_CR9","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. W. H. Freeman & Co., New York, NY, USA (1979)"},{"key":"2282_CR10","unstructured":"DeVries, A.N.: Tight representations of specially-structured 0-1 linear, quadratic, and polynomial programs. PhD thesis, Clemson University (2018). https:\/\/open.clemson.edu\/all_dissertations\/2246"},{"key":"2282_CR11","first-page":"5","volume":"1","author":"R Fortet","year":"1959","unstructured":"Fortet, R.: L\u2019alg\u00e8bre de boole et ses applications en recherche op\u00e9rationnelle. Cahiers du Centre d\u2019Etudes de Recherche Op\u00e9rationnelle 1, 5\u201336 (1959)","journal-title":"Cahiers du Centre d\u2019Etudes de Recherche Op\u00e9rationnelle"},{"issue":"1","key":"2282_CR12","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1287\/opre.21.1.156","volume":"21","author":"F Glover","year":"1973","unstructured":"Glover, F., Woolsey, E.: Further reduction of zero-one polynomial programming problems to zero-one linear programming problems. Oper. Res. 21(1), 156\u2013161 (1973)","journal-title":"Oper. Res."},{"issue":"1","key":"2282_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The boolean quadric polytope: Some characteristics, facets and relatives. Math. Program. 45(1), 139\u2013172 (1989). https:\/\/doi.org\/10.1007\/BF01589101","journal-title":"Math. Program."},{"key":"2282_CR14","first-page":"251","volume-title":"The Traveling Salesman Problem","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., Padberg, M.W.: Polyhedral theory. In: Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B. (eds.) The Traveling Salesman Problem, pp. 251\u2013305. John Wiley & Sons Inc, New York, NY, USA (1985)"},{"key":"2282_CR15","unstructured":"J\u00fcnger, M., Mallach, S.: Odd-cycle separation for maximum cut and binary quadratic optimization. In: Bender, M.A., Svensson, O., Herman, G. (eds.) 27th Annual European Symp. on Algorithms (ESA 2019). Leibniz Intern. Proc. in Informatics (LIPIcs), vol. 144, pp. 63\u201316313. Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.63 . http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/11184"},{"issue":"4","key":"2282_CR16","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1287\/ijoc.2020.1008","volume":"33","author":"M J\u00fcnger","year":"2021","unstructured":"J\u00fcnger, M., Mallach, S.: Exact facetial odd-cycle separation for maximum cut and binary quadratic optimization. INFORMS J. Comput. 33(4), 1419\u20131430 (2021). https:\/\/doi.org\/10.1287\/ijoc.2020.1008","journal-title":"INFORMS J. Comput."},{"issue":"10","key":"2282_CR17","doi-asserted-by":"publisher","first-page":"6581","DOI":"10.1109\/TIT.2012.2204955","volume":"58","author":"X Zhang","year":"2012","unstructured":"Zhang, X., Siegel, P.H.: Adaptive cut generation algorithm for improved linear programming decoding of binary linear codes. IEEE Trans. Inf. Theory 58(10), 6581\u20136594 (2012). https:\/\/doi.org\/10.1109\/TIT.2012.2204955","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2282_CR18","doi-asserted-by":"publisher","unstructured":"Charfreitag, J., Mallach, S., Mutzel, P.: Integer programming for the maximum cut problem: A refined model and implications for branching. In: Berry, J., Shmoys, D.B. (eds.) Proc. of the 2023 SIAM Conf. on Applied and Computational Discrete Algorithms (ACDA23), pp. 63\u201374 (2023). https:\/\/doi.org\/10.1137\/1.9781611977714.6","DOI":"10.1137\/1.9781611977714.6"},{"issue":"2","key":"2282_CR19","doi-asserted-by":"publisher","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(2), 157\u2013173 (1986). https:\/\/doi.org\/10.1007\/BF02592023","journal-title":"Math. Program."}],"updated-by":[{"DOI":"10.1007\/s11590-026-02294-w","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T00:00:00Z","timestamp":1776470400000}}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-026-02282-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-026-02282-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-026-02282-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:42:35Z","timestamp":1782484955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-026-02282-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,12]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["2282"],"URL":"https:\/\/doi.org\/10.1007\/s11590-026-02282-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,12]]},"assertion":[{"value":"17 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original online version of this article was revised due incorrect typo error in body text . Now, it has been corrected.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2026","order":8,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":9,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":10,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11590-026-02294-w","URL":"https:\/\/doi.org\/10.1007\/s11590-026-02294-w","order":11,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}