Now showing items 1-1 of 1

    • The linear assignment problem 

      Akgül, Mustafa (Springer, 1992)
      We present a broad survey of recent polynomial algorithms for the linear assignment problem. They all use essentially alternating trees and/or strongly feasible trees. Most of them employ Dijkstra’s shortest path algorithm ...