A Successive Shortest Path Algorithm for The Assignment Problem

DOI10.1080/03155986.1982.11731874MaRDI QIDQ4744086zbMATH OpenOpenAlexFDO

Authors 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 graphcomparison of algorithmscomputational experiencescomputer implementationrelaxed optimal solutionrelaxed problemsparse assignment problemsuccessive shortest path algorithm

Mathematics Subject Classification ID

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

Cited in

(8)

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

This page was built for publication: A Successive Shortest Path Algorithm for The Assignment Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744086)