Article Outline
Keywords
See also
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chretienne P (1989) A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. Europ J Oper Res 43:225–230
Greenberg DE (1969) A quadratic assignment problem without column constraints. Naval Res Logist Quart 16:417–422
Malucelli F (1993) Quadratic assignment problems: solution methods and applications. PhD Thesis, Dip. Informatica, Univ. Pisa
Malucelli F, Pretolani D (1993) Lower bounds for the quadratic semi-assignment problem. Techn Report 955, Centre Rech Transports, Univ Montréal, Canada
Milis IZ, Magirou VF (1995) A Lagrangean relaxation algorithm for sparse quadratic assignment problems. Oper Res Lett 17:69–76
Stone HS (1977) Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans Softw Eng 4:85–93
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Pitsoulis, L. (2008). Quadratic Semi-assignment Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_540
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_540
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering