On solving a variation of the assignment problem

DOI10.1016/0377-2217(94)00151-2zbMath0921.90126OpenAlexW2120747260MaRDI QIDQ1390267

Zhiying Jin, Ronald D. Armstrong

Publication date: 14 July 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00151-2

zbMATH Keywords

assignment problembottleneck assignmentBalinski's signature methodstrong dual feasible treesupervisory cost

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (2)

Task assignment in tree-like hierarchical structures ⋮ Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

Cites Work

• Solving linear bottleneck assignment problems via strong spanning trees
• A variation of the assignment problem
• 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

This page was built for publication: On solving a variation of the assignment problem