A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem

DOI10.1287/opre.40.1.178zbMath0751.90050OpenAlexW2088009736MaRDI QIDQ3991331

Jeffrey L. Kennington, Zhiming Wang

Publication date: 28 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.40.1.178

zbMATH Keywords

semi-assignment problemshortest augmenting path algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (13)

Solving the \(k\)-cardinality assignment problem by transformation ⋮ Assignment problems: a golden anniversary survey ⋮ The singly constrained assignment problem: An AP basis algorithm ⋮ A note on the assignment problem with seniority and job priority constraints. ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Bicriterion scheduling with equal processing times on a batch processing machine ⋮ An O(\(n\)) bound for the diameter of transshipment polytopes ⋮ The multi-period incremental service facility location problem ⋮ Variational approximation of interface energies and applications ⋮ A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem ⋮ Linear and semi-assignment problems: A core oriented approach ⋮ The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm ⋮ Linear assignment procedures

This page was built for publication: A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem