A NOTE ON AIRLINE COMMUTING
暂无分享，去创建一个
The problem of how to buy and use plane tickets in order to minimize the costs of a given series of flights between two cities can be expressed as an assignment problem.
[1] R. Burkard,et al. Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .
[2] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[3] H. Kuhn. The Hungarian method for the assignment problem , 1955 .