{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:09:33Z","timestamp":1761894573346},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645900"},{"type":"electronic","value":"9783540693468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_31","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T15:51:29Z","timestamp":1186069889000},"page":"409-422","source":"Crossref","is-referenced-by-count":18,"title":["Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations"],"prefix":"10.1007","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"A. Br\u00fcngger, A. Marzetta, J. Clausen, and M. Perregaard. Joining forces in solving large-scale quadratic assignment problems. In Proceedings of the 11th International Parallel Processing Symposium IPPS, pages 418\u2013427, 1997.","DOI":"10.1109\/IPPS.1997.580936"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R. E. Burkard","year":"1997","unstructured":"R. E. Burkard, S. E. Karisch, and F. Rendl. QAPLIB-A quadratic assignment problem library. Journal of Global Optimization, 10:391\u2013403, 1997.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1008696503659","volume":"8","author":"J. Clausen","year":"1997","unstructured":"J. Clausen and M. Perregaard. Solving large quadratic assignment problems in parallel. Computational Optimization and Applications, 8(2):111\u2013127, 1997.","journal-title":"Computational Optimization and Applications"},{"key":"31_CR4","unstructured":"M. J\u00fcnger and V. Kaibel. On the SQAP-polytope. Technical Report 96.241, Angewandte Mathematik und Informatik, Universit\u00e4t zu K\u00f6ln, 1996."},{"key":"31_CR5","unstructured":"M. J\u00fcnger and V. Kaibel. Box-inequalities for quadratic assignment polytopes. Technical Report 97.285, Angewandte Mathematik und Informatik, Universit\u00e4t zu K\u00f6ln, 1997."},{"key":"31_CR6","unstructured":"M. J\u00fcnger and V. Kaibel. The QAP-polytope and the star-transformation. Technical Report 97.284, Angewandte Mathematik und Informatik, Universit\u00e4t zu K\u00f6ln, 1997."},{"key":"31_CR7","unstructured":"M. J\u00fcnger and S. Thienel. Introduction to ABACUS \u2014 A Branch-And-CUt System. Technical Report 97.263, Angewandte Mathematik und Informatik, Universit\u00e4t zu K\u00f6ln, 1997. (To appear in OR Letters)."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"V. Kaibel. Polyhedral Combinatorics of the Quadratic Assignment Problem. PhD thesis, Universit\u00e4t zu K\u00f6ln, 1997. http:\/\/www.informatik.uni-koeln.de\/ls_juenger\/staff\/kaibel\/diss.html .","DOI":"10.1007\/3-540-69346-7_31"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01585995","volume":"71","author":"S. E. Karisch","year":"1995","unstructured":"S. E. Karisch and F. Rendl. Lower bounds for the quadratic assignment problem via triangle decompositions. Mathematical Programming, 71(2):137\u2013152, 1995.","journal-title":"Mathematical Programming"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T. C. Koopmans","year":"1957","unstructured":"T. C. Koopmans and M. J. Beckmann. Assignment problems and the location of economic activities. Econometrica, 25:53\u201376, 1957.","journal-title":"Econometrica"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"M. Padberg and M. P. Rijal. Location, Scheduling, Design and Integer Programming. Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-1-4613-1379-3"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1287\/opre.43.5.781","volume":"43","author":"M. G. C. Resende","year":"1995","unstructured":"M. G. C. Resende, K. G. Ramakrishnan, and Z. Drezner. Computing lower bounds for the quadratic assignment problem with an interior point solver for linear programming. Operations Research, 43:781\u2013791, 1995.","journal-title":"Operations Research"},{"key":"31_CR13","unstructured":"M. P. Rijal. Scheduling, Design and Assignment Problems with Quadratic Costs. PhD thesis, New York University, 1995."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"S. Sahni and T. Gonzales. P-complete approximation problems. Journal of the Association for Computing Machinery, 1976.","DOI":"10.1145\/321958.321975"}],"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-69346-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:06:01Z","timestamp":1556733961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-69346-7_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}