| Article ID: | iaor1999420 |
| Country: | Netherlands |
| Volume: | 91 |
| Issue: | 3 |
| Start Page Number: | 619 |
| End Page Number: | 622 |
| Publication Date: | Jun 1996 |
| Journal: | European Journal of Operational Research |
| Authors: | Malucelli Federico |
| Keywords: | timetabling, programming: assignment |
The Quadratic Semi-Assignment Problem (QSAP) models a large variety of practical applications. In the present note we will consider a particular class of QSAP that can be solved by determining the maximum cost flow on a network. This class of problems arises in schedule synchronization and in transportation.