Yokoya, Daisuke; Duin, Cees W.; Yamada, Takeo - In: European Journal of Operational Research 210 (2011) 2, pp. 185-193
We consider the repeated assignment problem (RAP), which is a K-fold repetition of the n × n linear assignment problem (LAP), with the additional requirement that no assignment can be repeated more than once. In actual applications K is typically much smaller than n. First, we derive upper...