메뉴 건너뛰기




Volumn 38, Issue 4, 1987, Pages 325-340

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Author keywords

AMS Subject Classifications: 90C08, 68E10; Linear assignment problem; Pascal implementation; shortest path methods

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES - PASCAL;

EID: 0023173192     PISSN: 0010485X     EISSN: 14365057     Source Type: Journal    
DOI: 10.1007/BF02278710     Document Type: Article
Times cited : (1024)

References (29)
  • 6
    • 0020934738 scopus 로고
    • Algorithm 50: algorithm for the solution of the assignment problem for sparse matrices
    • (1983) Computing , vol.31 , pp. 83-94
    • Carpaneto, G.1    Toth, P.2
  • 8
    • 0022579095 scopus 로고
    • An efficient labeling technique for solving sparse assignment problems
    • (1986) Computing , vol.36 , pp. 301-311
    • Derigs, U.1    Metz, A.2
  • 19
    • 84936232175 scopus 로고    scopus 로고
    • Jonker, R.: Traveling salesman and assignment algorithms: design and implementation. Faculty of Actuarial Science and Econometrics, University of Amsterdam (1986).
  • 21
    • 84986946743 scopus 로고
    • An algorithm to solve the m×n assignment problem in expected time O (mn log n)
    • (1980) Networks , vol.10 , pp. 143-152
    • Karp, R.M.1
  • 29
    • 0015202957 scopus 로고
    • On some techniques useful for the solution of transportation problems
    • (1971) Networks , vol.1 , pp. 173-194
    • Tomizawa, N.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.