{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T12:35:26Z","timestamp":1768653326350,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-20-1-2072"],"award-info":[{"award-number":["N00014-20-1-2072"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00840-z","type":"journal-article","created":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T11:02:32Z","timestamp":1642762952000},"page":"498-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9884-8533","authenticated-orcid":false,"given":"Richard J.","family":"Forrester","sequence":"first","affiliation":[]},{"given":"Lucas A.","family":"Waddell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,21]]},"reference":[{"issue":"1","key":"840_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.orl.2004.05.001","volume":"33","author":"W Adams","year":"2005","unstructured":"Adams W, Forrester R (2005) A simple recipe for concise mixed 0\u20131 linearizations. Oper Res Lett 33(1):55\u201361","journal-title":"Oper Res Lett"},{"issue":"3","key":"840_CR2","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","volume":"180","author":"WP Adams","year":"2007","unstructured":"Adams WP, Guignard M, Hahn PM, Hightower WL (2007) A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur J Oper Res 180(3):983\u2013996","journal-title":"Eur J Oper Res"},{"issue":"2","key":"840_CR3","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0377-2217(94)00229-0","volume":"92","author":"A Billionnet","year":"1996","unstructured":"Billionnet A, Calmels F (1996) Linear programming for the 0\u20131 quadratic knapsack problem. Eur J Oper Res 92(2):310\u2013325","journal-title":"Eur J Oper Res"},{"issue":"2","key":"840_CR4","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/ijoc.1030.0029","volume":"16","author":"A Billionnet","year":"2004","unstructured":"Billionnet A, Soutif E (2004) Using a mixed integer programming tool for solving the 0\u20131 quadratic knapsack problem. INFORMS J Comput 16(2):188\u2013197","journal-title":"INFORMS J Comput"},{"issue":"2","key":"840_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A Caprara","year":"1999","unstructured":"Caprara A, Pisinger D, Toth P (1999) Exact solution of the quadratic Knapsack problem. INFORMS J Comput 11(2):125\u2013137","journal-title":"INFORMS J Comput"},{"issue":"4","key":"840_CR6","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1080\/02331934.2015.1091821","volume":"65","author":"R Forrester","year":"2016","unstructured":"Forrester R (2016) Tightening concise linear reformulations of 0\u20131 cubic programs. Optimization 65(4):877\u2013903","journal-title":"Optimization"},{"key":"840_CR7","doi-asserted-by":"crossref","unstructured":"Forrester R, Hunt-Isaak N (2020) Computational comparison of exact solution methods for 0\u20131 quadratic programs: recommendations for practioners. J Appl Math, vol\u00a02020, Article ID 5974820, p 21","DOI":"10.1155\/2020\/5974820"},{"key":"840_CR8","unstructured":"Forrester R (1997) Effective, Compact Linear Formulations of 0\u20131 Quadratic Programs. Department of Mathematical Sciences, Clemson University, Clemson, SC, Master\u2019s Project"},{"issue":"7","key":"840_CR9","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1287\/mnsc.30.7.890","volume":"30","author":"G Fox","year":"1984","unstructured":"Fox G, Baker N, Bryant J (1984) Economic models for R and D project selections in the presence of project interactions. Manag Sci 30(7):890\u2013902","journal-title":"Manag Sci"},{"issue":"1","key":"840_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo G, Grigoriadis M, Tarjan R (1989) A fast parametric maximum flow algorithm and applications. SIAM J Comput 18(1):30\u201355","journal-title":"SIAM J Comput"},{"key":"840_CR11","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G Gallo","year":"1980","unstructured":"Gallo G, Hammer P, Simeone B (1980) Quadratic Knapsack problems. Math Program Stud 12:132\u2013149","journal-title":"Math Program Stud"},{"issue":"4","key":"840_CR12","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover F (1975) Improved linear integer programming formulations of nonlinear integer programs. Manag Sci 22(4):455\u2013460","journal-title":"Manag Sci"},{"issue":"1","key":"840_CR13","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover F, Woolsey E (1974) Converting the 0\u20131 Polynomial Programming Problem to a 0\u20131 Linear Program. Oper Res 22(1):180\u2013182","journal-title":"Oper Res"},{"key":"840_CR14","unstructured":"Kofler C, Greistorfer P, Wang H, Kochenberger G (2014) A Penalty Function Approach to Max 3-SAT Problems, Working Paper Series, Social and Economic Sciences, Faculty of Social and Economic Sciences, Karl-Franzens-University Graz. Available from https:\/\/ideas.repec.org\/p\/grz\/wpsses\/2014-04.html"},{"issue":"6","key":"840_CR15","doi-asserted-by":"publisher","first-page":"1446","DOI":"10.1109\/TCBB.2016.2595583","volume":"14","author":"S Mohammadi","year":"2017","unstructured":"Mohammadi S, Gleich D, Kolda T, Grama A (2017) Triangular alignment (TAME): a tensor-based approach for higher-order network alignment. IEEE\/ACM Trans Comput Biol Bioinform 14(6):1446\u20131458","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"3","key":"840_CR16","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H Sherali","year":"1990","unstructured":"Sherali H, Adams W (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero\u2013one programming problems. SIAM J Discrete Math 3(3):411\u2013430","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"840_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"H Sherali","year":"1994","unstructured":"Sherali H, Adams W (1994) A hierarchy of relaxations and convex hull characterizations for mixed-integer zero\u2013one programming problems. Discrete Appl Math 52(1):83\u2013106","journal-title":"Discrete Appl Math"},{"issue":"7","key":"840_CR18","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1287\/mnsc.12.7.485","volume":"12","author":"H Weingartner","year":"1966","unstructured":"Weingartner H (1966) Capital budgeting of interrelated projects: survey and synthesis. Manag Sci 12(7):485\u2013516","journal-title":"Manag Sci"},{"key":"840_CR19","unstructured":"Zhao K (2008) Treatments of Chlamydia Trachomatis and Neisseria Gonorrhoeae, Mathematics Thesis, Georgia State University. Available from http:\/\/scholarworks.gsu.edu\/math_theses\/49"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00840-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00840-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00840-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:30:30Z","timestamp":1659079830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00840-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,21]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["840"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00840-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,21]]},"assertion":[{"value":"11 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}