|
|
||||||||
Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, 1018 WB Amsterdam, The Netherlands
A classic application of the linear assignment problem is the assignment of people to jobs (or jobs to people). In this context, it is interesting to measure competition for jobs and to generate a suitable list of jobs from which a person can choose; the length of the list is a parameter. A known list-generation procedure is based on an interior-point method followed by a parametric analysis. We describe a more efficient procedure, exploiting linear assignment theory and shortest-path computations. Further, we propose an alternative list-generation procedure, based on a special type of dual values for the linear assignment problem.
a.volgenant{at}uva.nl
Subject classifications: assignment problems; matchings; parametric analysis.
History: Received December 2005;
revision received April 2007;
accepted April 2007.
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |