An algorithm for then×n optimum assignment problem

This publication has 13 references indexed in Scilit:

• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
  Management Science, 1974
• A fundamental problem in vehicle routing
  Networks, 1974
• The shortest and the K‐shortest routes as assignment problems
  Networks, 1973
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
  Journal of the ACM, 1972
• On some techniques useful for solution of transportation network problems
  Networks, 1971
• A Graph-Theoretic Approach to a Class of Integer-Programming Problems
  Operations Research, 1969
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
  Operations Research, 1968
• A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems
  IMA Journal of Applied Mathematics, 1967
• Algorithms for the Assignment and Transportation Problems
  Journal of the Society for Industrial and Applied Mathematics, 1957
• The Hungarian method for the assignment problem
  Naval Research Logistics Quarterly, 1955