A Note on Parametric Analysis in Linear Assignment

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 li...

Full description

Saved in:
Bibliographic Details
Published inOperations research Vol. 56; no. 2; pp. 519 - 522
Main Author Volgenant, A.
Format Journal Article
LanguageEnglish
Published Linthicum, MD Institute for Operations Research and the Management Sciences 01.03.2008
Subjects
Algorithms
Analysis
Applied sciences
Assignment problem
Cost allocation
Cost efficiency
Exact sciences and technology
Linear complementarity problem
Operational research. Management science
Optimal solutions
Parametric equations
Shortest path algorithms
Studies
Technical Note
United States
United States > US
Interior point method
Shortest path
assignment problems
Parametric analysis
Assignment problem
matchings
Online AccessGet full text
ISSN0030-364X
1526-5463
DOI10.1287/opre.1070.0470

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.1070.0470