{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:31:23Z","timestamp":1743096683195,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":6,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_540","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:09:00Z","timestamp":1219662540000},"page":"3170-3171","source":"Crossref","is-referenced-by-count":4,"title":["Quadratic Semi-assignment Problem"],"prefix":"10.1007","author":[{"given":"Leonidas","family":"Pitsoulis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"540_CR1_540","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0377-2217(89)90216-6","volume":"43","author":"P. Chretienne","year":"1989","unstructured":"Chretienne P (1989) A\u00a0polynomial algorithm to optimally schedule tasks on a\u00a0virtual distributed system under tree-like\n\t  precedence constraints. Europ J Oper Res 43:225\u2013230","journal-title":"Europ. J. Oper. Res."},{"key":"540_CR2_540","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1002\/nav.3800160312","volume":"16","author":"D.E. Greenberg","year":"1969","unstructured":"Greenberg DE (1969) A\u00a0quadratic assignment problem without column constraints. Naval Res Logist Quart\n\t  16:417\u2013422","journal-title":"Naval Res. Logist. Quart."},{"key":"540_CR3_540","unstructured":"Malucelli F (1993) Quadratic assignment\n\tproblems: solution methods and applications. PhD Thesis, Dip. Informatica, Univ. Pisa"},{"key":"540_CR4_540","unstructured":"Malucelli F, Pretolani D (1993) Lower\n\tbounds for the quadratic semi-assignment problem. Techn Report 955, Centre Rech Transports, Univ Montr\u00e9al, Canada"},{"key":"540_CR5_540","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0167-6377(94)00061-A","volume":"17","author":"I.Z. Milis","year":"1995","unstructured":"Milis IZ, Magirou VF (1995) A\u00a0Lagrangean relaxation algorithm for sparse quadratic assignment problems. Oper Res Lett\n\t  17:69\u201376","journal-title":"Oper. Res. Lett."},{"key":"540_CR6_540","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/TSE.1977.233840","volume":"4","author":"H.S. Stone","year":"1977","unstructured":"Stone HS (1977) Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans Softw Eng\n\t  4:85\u201393","journal-title":"IEEE Trans. Software Engin."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:53:32Z","timestamp":1720691612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_540"}},"subtitle":["QSAP"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_540","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}