A Successive Shortest Path Algorithm for The Assignment Problem

DOI10.1080/03155986.1982.11731874zbMath0506.90085OpenAlexW1508977476MaRDI QIDQ4744086

Michael Engquist

Publication date: 1982

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1982.11731874

zbMATH Keywords

bipartite graphrelaxed problemcomparison of algorithmscomputer implementationsuccessive shortest path algorithmcomputational experiencesrelaxed optimal solutionsparse assignment problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care ⋮ Algorithms for finding a \(K\)th best valued assignment ⋮ A new two-stage heuristic for the recreational vehicle scheduling problem ⋮ The auction algorithm for the transportation problem ⋮ Aircrew schedule generation using repeated matching ⋮ An efficient algorithm for the bipartite matching problem ⋮ The auction algorithm: A distributed relaxation method for the assignment problem