id: 01179832
dt: j
an: 01179832
au: Chadha, Shayam S.; Wineinger, Thomas
ti: Hungarian method and a postman’s problem.
so: Econ. Comput. Econ. Cybern. Stud. Res. 29, No.1-4, 95-101 (1995).
py: 1995
pu: Academy of Economic Studies, Faculty of Cybernetics, Statistics and
    Economic Informatics, Bucharest
la: EN
cc: 
ut: arc routing; Hungarian method; assignment
ci: 
li: 
ab: Summary: The Hungarian method for solving an assignment problem has been
    specialized for solving an assignment problem whose payoff matrix is
    symmetric and all the diagonal entries are infinitely large. An example
    illustrates the steps of the proposed algorithm.
rv: