Cees W. Duin

Learn More
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 and lower bounds respectively by a heuristic together with local(More)
  • 1