{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:40:26Z","timestamp":1648791626609},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4368,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s0166-218x(00)00272-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:40:30Z","timestamp":1027618830000},"page":"283-306","source":"Crossref","is-referenced-by-count":8,"title":["The QAP-polytope and the star transformation"],"prefix":"10.1016","volume":"111","author":[{"given":"Michael","family":"J\u00fcnger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Kaibel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00272-9_BIB1","doi-asserted-by":"crossref","unstructured":"W.P. Adams, T.A. Johnson, Improved linear programming-based lower bounds for the quadratic assignment problem, in: P.M. Pardalos, H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994, pp. 43\u201375.","DOI":"10.1090\/dimacs\/016\/02"},{"key":"10.1016\/S0166-218X(00)00272-9_BIB2","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1137\/1016083","article-title":"On the assignment polytope","volume":"16","author":"Balinski","year":"1974","journal-title":"SIAM Rev."},{"key":"10.1016\/S0166-218X(00)00272-9_BIB3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","article-title":"On the cut polytope","volume":"36","author":"Barahona","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00272-9_BIB4","first-page":"161","article-title":"Combinatorial complexity of orbits in representations of the symmetric group","volume":"9","author":"Barvinok","year":"1992","journal-title":"Adv. Soviet Math."},{"key":"10.1016\/S0166-218X(00)00272-9_BIB5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","article-title":"The cut polytope and the boolean quadric polytope","volume":"79","author":"De Simone","year":"1989","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/S0166-218X(00)00272-9_BIB6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01302894","article-title":"Lower bounds based on linear programming for the quadratic assignment problem","volume":"4","author":"Drezner","year":"1995","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/S0166-218X(00)00272-9_BIB7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","article-title":"Optimal and suboptimal algorithms for the quadratic assignment problem","volume":"10","author":"Gilmore","year":"1962","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(00)00272-9_BIB8","unstructured":"T.A. Johnson, New linear-programming based solution procedures for the quadratic assignment problem, Ph.D. Thesis, Graduate School of Clemson University, 1992."},{"key":"10.1016\/S0166-218X(00)00272-9_BIB9","unstructured":"M. J\u00fcnger, V. Kaibel, A basic study of the QAP-Polytope, Technical Report 96.215, Angewandte Mathematik und Informatik, Universit\u00e4t zu K\u00f6ln, 1996."},{"key":"10.1016\/S0166-218X(00)00272-9_BIB10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"key":"10.1016\/S0166-218X(00)00272-9_BIB11","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","article-title":"The quadratic assignment problem","volume":"9","author":"Lawler","year":"1963","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(00)00272-9_BIB12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","article-title":"The boolean quadric polytope: some characteristics and facets","volume":"45\u20131","author":"Padberg","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00272-9_BIB13","series-title":"Location, Scheduling, Design and Integer Programming","author":"Padberg","year":"1996"},{"key":"10.1016\/S0166-218X(00)00272-9_BIB14","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1287\/opre.43.5.781","article-title":"Computing lower bounds for the quadratic assignment problem with an interior point solver for linear programming","volume":"43","author":"Resende","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00272-9_BIB15","unstructured":"M.P. Rijal, Scheduling, design and assignment problems with quadratic costs, Ph.D. Thesis, New York University, 1995."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002729?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002729?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T16:53:59Z","timestamp":1556124839000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0166218X00002729"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00272-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}