A Primal Method for the Assignment and Transportation Problems | Zendy

Michel Balinski | Zendy; Ralph E. Gomory | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Primal Method for the Assignment and Transportation Problems

Author(s) -

Michel Balinski,

Ralph E. Gomory

Publication year - 1964

Publication title -

management science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 4.954

H-Index - 255

eISSN - 1526-5501

pISSN - 0025-1909

DOI - 10.1287/mnsc.10.3.578

Subject(s) - assignment problem , mathematical optimization , dual (grammatical number) , simple (philosophy) , hungarian algorithm , computer science , weapon target assignment problem , transportation theory , generalized assignment problem , mathematics , art , philosophy , literature , epistemology

This paper describes a simple calculation for the assignment and transportation problems which is "dual to" the well-known Hungarian Method. While the Hungarian is a dual method, this method is primal and so gives a feasible assignment at each stage of the calculation. Bounds on the number of steps required for the assignment and transportation problems are given. They are the same as the best bounds known for the Hungarian Method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research