On solving a variation of the assignment problem

DOI10.1016/0377-2217(94)00151-2MaRDI QIDQ1390267zbMATH OpenOpenAlexFDO

Authors Ronald D. Armstrong, Zhiying Jin

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) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A variation of the assignment problem
• Efficient dual simplex algorithms for the assignment problem
• A relaxation column signature method for assignment problems
• A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem

Cites work

• A competitive (dual) simplex method for the assignment problem
• A variation of the assignment problem
• Efficient dual simplex algorithms for the assignment problem
• Maximum matchings in bipartite graphs via strong spanning trees
• Solving linear bottleneck assignment problems via strong spanning trees

Cited in

(15)

• Approach to finding the optimal solution in the assignment problem
• Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
• A variant of time minimizing assignment problem
• Solving the \(k\)-cardinality assignment problem by transformation
• The assignment problem
• A variation of the assignment problem
• scientific article; zbMATH DE number 5629801 (Why is no real title available?)
• Assignment problems with complementarities
• scientific article; zbMATH DE number 1084188 (Why is no real title available?)
• A reduction approach to the repeated assignment problem
• Assignment problems: a golden anniversary survey
• ON A PERSONNEL ASSIGNMENT PROBLEM
• Task assignment in tree-like hierarchical structures
• A new look at the optimal assignment problem
• On the Euclidean assignment problem

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

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