Solving linear bottleneck assignment problems via strong spanning trees

DOI10.1016/0167-6377(92)90103-AzbMath0757.90079OpenAlexW2061330415MaRDI QIDQ1200788

Zhiying Jin, Ronald D. Armstrong

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90103-a

zbMATH Keywords

linear bottleneck assignmentsignature methodstrong spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem ⋮ A new strongly polynomial dual network simplex algorithm ⋮ A fast algorithm for a class of bottleneck problems ⋮ The bottleneck generalized assignment problem ⋮ On solving a variation of the assignment problem ⋮ An improved algorithm for two stage time minimization assignment problem

Cites Work

• An augmenting path method for solving linear bottleneck assignment problems
• Maximum matchings in bipartite graphs via strong spanning trees
• Efficient dual simplex algorithms for the assignment problem
• A competitive (dual) simplex method for the assignment problem
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• A Note on Assignment Problems

This page was built for publication: Solving linear bottleneck assignment problems via strong spanning trees