Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Dual coordinate step methods for linear network flow problems
Mathematical Programming: Series A and B
Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
New scaling algorithms for the assignment and minimum mean cycle problems
Mathematical Programming: Series A and B
Vectorization of an auction algorithm for linear cost assignment problem
Computers and Industrial Engineering
A comparison of two algorithms for the assignment problem
Computational Optimization and Applications
| Hi-index | 0.00 |
We introduce a new two-phase technique to solve highly asymmetric assignment problems. In the first phase, the assignment problem is decomposed into subproblems which are solved in parallel. The first phase is used to exclude certain suboptimal assignments from consideration in the second phase. In the second phase, the optimal assignment is finalized. We show that the two-phase algorithm can reduce the theoretical time bound for solving an $n \times k$ assignment problem ($ n