메뉴 건너뛰기




Volumn 15, Issue 1, 2005, Pages 147-158

A parametric visualization software for the assignment problem

Author keywords

Assignment problem; Computer algorithms; Network simplex algorithm; Visualization

Indexed keywords


EID: 84888278117     PISSN: 03540243     EISSN: 23346043     Source Type: Journal    
DOI: 10.2298/YJOR0501147P     Document Type: Article
Times cited : (3)

References (28)
  • 2
    • 4744358005 scopus 로고    scopus 로고
    • A forest exterior point algorithm for the assignment problems
    • P.M. Pardalos, A. Migdalas and A. Buckard (eds.), Word Scientific Publishing Co
    • Achatz, H., Paparrizos, K., Samaras, N., and Tsiplidis, K., "A forest exterior point algorithm for the assignment problems", in: P.M. Pardalos, A. Migdalas and A. Buckard (eds.), Combinatorial and Global Optimization, Word Scientific Publishing Co., 2002, 1-10.
    • (2002) Combinatorial and Global Optimization , pp. 1-10
    • Achatz, H.1    Paparrizos, K.2    Samaras, N.3    Tsiplidis, K.4
  • 4
    • 0001763733 scopus 로고
    • A primal method for the assignment and transportation problems
    • Balinski, M.L., and Gomory, R.E., "A primal method for the assignment and transportation problems", Management Sciences, 10 (1964) 578-598.
    • (1964) Management Sciences , vol.10 , pp. 578-598
    • Balinski, M.L.1    Gomory, R.E.2
  • 5
    • 0002224079 scopus 로고
    • The alternating basis algorithm for assignment problems
    • Barr, R.S., Glover, F., and Klingman, D., "The alternating basis algorithm for assignment problems", Mathematical Programming, 13 (1977) 1-13.
    • (1977) Mathematical Programming , vol.13 , pp. 1-13
    • Barr, R.S.1    Glover, F.2    Klingman, D.3
  • 6
    • 34250244023 scopus 로고
    • A new algorithm for the assignment problem
    • Bertsekas, D., "A new algorithm for the assignment problem", Mathematical Programming, 21 (1981) 152-171.
    • (1981) Mathematical Programming , vol.21 , pp. 152-171
    • Bertsekas, D.1
  • 7
    • 77949411389 scopus 로고    scopus 로고
    • Fundamental techniques for algorithm animation displays
    • Stasko, T.J., Dominique, J., Brown, H.M., and Price, A.B., (eds.), MIT Press
    • Brown, M.H., and Hershberger, J., "Fundamental techniques for algorithm animation displays", in: Stasko, T.J., Dominique, J., Brown, H.M., and Price, A.B., (eds.), Software Visualization: Programming as a Multimedia Experience, MIT Press, 1998, 137-143.
    • (1998) Software Visualization: Programming As A Multimedia Experience , pp. 137-143
    • Brown, M.H.1    Hershberger, J.2
  • 12
    • 0001900752 scopus 로고
    • Application of the simplex method to a transportation problem
    • Koopmans, T.C. (ed.), Willey, N.Y
    • Dantzig, B.G., "Application of the simplex method to a transportation problem", in: Koopmans, T.C. (ed.), Activity Analysis and Production and Allocation, Willey, N.Y., 1951, 359-373.
    • (1951) Activity Analysis and Production and Allocation , pp. 359-373
    • Dantzig, B.G.1
  • 15
    • 85181644954 scopus 로고    scopus 로고
    • Univ. of Texas, Austin
    • http://ccwf.cc.utexas.edu/~sakshi/Univ. of Texas, Austin.
  • 17
    • 0041139567 scopus 로고
    • Solving the assignment problem by relaxation
    • Hung, M.S., and Rom, W.D., "Solving the assignment problem by relaxation", Operations Research, 28 (1980) 969-982.
    • (1980) Operations Research , vol.28 , pp. 969-982
    • Hung, M.S.1    Rom, W.D.2
  • 20
    • 0035263065 scopus 로고    scopus 로고
    • Rethinking the evaluation of algorithm animations as learning AIDS: An observational study
    • Kehoe, C., Stasko, T.J., and Taylor, A., "Rethinking the evaluation of algorithm animations as learning aids: an observational study", International Journal of Human-Computer Studies, 54 (2001) 265-284.
    • (2001) International Journal of Human-Computer Studies , vol.54 , pp. 265-284
    • Kehoe, C.1    Stasko, T.J.2    Taylor, A.3
  • 21
    • 0035783538 scopus 로고    scopus 로고
    • Evega: An educational visualization environment for graph algorithms
    • Khuri, S., and Holzapfel, K., "EVEGA: An educational visualization environment for graph algorithms", ACM SIGCSE Bulletin, 33(3) (2001) 101-104.
    • (2001) ACM SIGCSE Bulletin , vol.33 , Issue.3 , pp. 101-104
    • Khuri, S.1    Holzapfel, K.2
  • 23
    • 0002719797 scopus 로고
    • The Hungarian method for the assignment problem
    • Kuhn, H. W. "The Hungarian method for the assignment problem", Naval Research Logistics Quarterly, 2 (1955) 83-97.
    • (1955) Naval Research Logistics Quarterly , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 25
    • 0030356631 scopus 로고    scopus 로고
    • A non improving simplex algorithm for transportation problems
    • Paparrizos, K., "A non improving simplex algorithm for transportation problems", Operations Research, 30 (1) (1996) 1-15.
    • (1996) Operations Research , vol.30 , Issue.1 , pp. 1-15
    • Paparrizos, K.1
  • 26
    • 0026185914 scopus 로고
    • An infeasible (exterior point) simplex algorithm for assignment problems
    • Paparrizos, K., "An infeasible (exterior point) simplex algorithm for assignment problems", Mathematical Programming, 51 (1991) 45-54.
    • (1991) Mathematical Programming , vol.51 , pp. 45-54
    • Paparrizos, K.1


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