메뉴 건너뛰기




Volumn 1, Issue , 2003, Pages 13-18

Distributed Algorithms for Dynamic Reassigment

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES;

EID: 1542359171     PISSN: 01912216     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (48)

References (11)
  • 1
    • 0000620444 scopus 로고
    • A Parallel Shortest Path Algorithm for the Assignment Problem
    • Oct.
    • E. Balas, D. Miller, J. Pekny and P. Toth, " A Parallel Shortest Path Algorithm for the Assignment Problem," Journal of the ACM, V. 38, pp 985-1004, Oct. 1991.
    • (1991) Journal of the ACM , vol.38 , pp. 985-1004
    • Balas, E.1    Miller, D.2    Pekny, J.3    Toth, P.4
  • 2
    • 0026226724 scopus 로고
    • Parallel Synchronous and Asynchronous Implementations of the Auction Algorithm
    • Sept.
    • D. P. Bertsekas and D. A. Castañón, "Parallel Synchronous and Asynchronous Implementations of the Auction Algorithm," Parallel Computing, V 17, Sept. 1991, pp. 707-732.
    • (1991) Parallel Computing , vol.17 , pp. 707-732
    • Bertsekas, D.P.1    Castañón, D.A.2
  • 3
    • 0041357637 scopus 로고
    • Parallel Asynchronous Hungarian Methods for the Assignment Problem
    • Summer
    • D. P. Bertsekas and D. A. Castañón, "Parallel Asynchronous Hungarian Methods for the Assignment Problem," ORSA Journal on Computing, V 5, No. 3, Summer, 1993.
    • (1993) ORSA Journal on Computing , vol.5 , Issue.3
    • Bertsekas, D.P.1    Castañón, D.A.2
  • 7
    • 0001764412 scopus 로고
    • Solving Minimum Cost Flow Problems by Successive Approximation
    • A. V. Goldberg and R. E. Tarjan, "Solving Minimum Cost Flow Problems by Successive Approximation," Mathematics of Operations Research, V. 15, pp. 430-466, 1990.
    • (1990) Mathematics of Operations Research , vol.15 , pp. 430-466
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 10
    • 0020203167 scopus 로고
    • A Successive Shortest Path algorithm for the Assignment Problem
    • M. Engquist, "A Successive Shortest Path algorithm for the Assignment Problem" INFOR. Vol. 20, 1982, pp. 370-384.
    • (1982) INFOR. , vol.20 , pp. 370-384
    • Engquist, M.1
  • 11
    • 24544472680 scopus 로고    scopus 로고
    • Model Predictive Control for Unreliable Dynamic Task Assignment
    • Las Vegas, NV, Dec.
    • D. A. Castañón and J. M Wohletz, "Model Predictive Control for Unreliable Dynamic Task Assignment," Proc. 2002 Conf. Decision and Control, Las Vegas, NV, Dec. 2002.
    • (2002) Proc. 2002 Conf. Decision and Control
    • Castañón, D.A.1    Wohletz, J.M.2


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