{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:37Z","timestamp":1725484297843},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540436768"},{"type":"electronic","value":"9783540478676"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47867-1_26","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T18:47:17Z","timestamp":1179946037000},"page":"367-383","source":"Crossref","is-referenced-by-count":0,"title":["The Distribution of Values in the Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Barvinok","sequence":"first","affiliation":[]},{"given":"Tamon","family":"Stephen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,21]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Anstreicher, K., Brixius, N., Goux, J.-P., Linderoth, J.: Solving large quadratic assignment problems on computational grids. Math Programming B (to appear)","DOI":"10.1007\/s101070100255"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0020-0190(00)00151-4","volume":"77","author":"E. Arkin","year":"2000","unstructured":"Arkin, E., Hassin, R., Sviridenko, M.: Approximating the maximum quadratic assignment problem. Inform. Process. Lett. 77 (2000) no. 1. 13\u201316","journal-title":"Inform. Process. Lett."},{"key":"26_CR3","volume-title":"Combinatorial optimization problems and their approximability properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. Combinatorial optimization problems and their approximability properties. Springer-Verlag, Berlin (1999)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1006\/jpdc.1998.1434","volume":"50","author":"A. Br\u00fcngger","year":"1998","unstructured":"Br\u00fcngger, A., Marzetta, A., Clausen, J., Perregaard M.: Solving large scale quadratic assignment problems in parallel with the search library ZRAM. Journal of Parallel and Distributed Computing 50 (1998) 157\u201366","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"26_CR5","unstructured":"Burkard, R., \u00e7Cela, E., Pardalos, P., Pitsoulis, L.: The quadratic assignment problem. In: Du, D.-Z., and Pardalos, P. M. (eds.): Handbook of Combinatorial Optimization. Kluwer Academic Publishers (1999) 75\u2013149"},{"key":"26_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0979-9","volume-title":"Representation theory","author":"W. Fulton","year":"1991","unstructured":"Fulton, W., Harris, J.: Representation theory. Springer-Verlag, New York (1991)"},{"key":"26_CR7","volume-title":"Combinatorial enumeration","author":"I. P. Goulden","year":"1983","unstructured":"Goulden, I. P., Jackson, D. M.: Combinatorial enumeration. John Wiley & Sons, Inc., New York (1983)"},{"issue":"7","key":"26_CR8","first-page":"452","volume":"17","author":"G. W. Graves","year":"1970","unstructured":"Graves, G. W., Whinston, A. B.: An algorithm for the quadratic assignment problem. Management Science 17 (1970) no. 7. 452\u201371","journal-title":"Management Science"},{"key":"26_CR9","unstructured":"Stephen, T.: The distribution of values in combinatorial optimization problems. Ph.D. Dissertation, University of Michigan (in preparation)"},{"issue":"2","key":"26_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"Y. Ye","year":"1999","unstructured":"Ye, Y.: Approximating quadratic programming with bound and quadratic constraints. Math. Programming 84 (1999) no. 2. 219\u2013226","journal-title":"Math. Programming"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47867-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T22:01:03Z","timestamp":1550354463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47867-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436768","9783540478676"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-47867-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}