메뉴 건너뛰기




Volumn 4, Issue 2, 2007, Pages 163-174

On the job rotation problem

Author keywords

Assignment problem; Job rotation problem; Node disjoint cycles; Principal submatrix

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

EID: 34047272351     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.11.003     Document Type: Article
Times cited : (7)

References (20)
  • 3
    • 84867995355 scopus 로고    scopus 로고
    • Selected topics in assignment problems
    • Burkard R.E. Selected topics in assignment problems. Discrete Applied Mathematics 123 (2002) 257-302
    • (2002) Discrete Applied Mathematics , vol.123 , pp. 257-302
    • Burkard, R.E.1
  • 4
    • 0041887449 scopus 로고    scopus 로고
    • Finding all essential terms of a characteristic maxpolynomial
    • Burkard R.E., and Butkovič P. Finding all essential terms of a characteristic maxpolynomial. Discrete Applied Mathematics 130 (2003) 367-380
    • (2003) Discrete Applied Mathematics , vol.130 , pp. 367-380
    • Burkard, R.E.1    Butkovič, P.2
  • 6
    • 0000956123 scopus 로고    scopus 로고
    • Pardalos P.M., and Du D.-Z. (Eds), Kluwer Academic Publishers
    • Burkard R.E., and Çela E. Linear Assignment Problems and Extensions. In: Pardalos P.M., and Du D.-Z. (Eds). Handbook of Combinatorial Optimization Supplement Volume A (1999), Kluwer Academic Publishers 75-149
    • (1999) Handbook of Combinatorial Optimization , vol.SUPPL. A , pp. 75-149
    • Burkard, R.E.1    Çela, E.2
  • 7
    • 34047257932 scopus 로고    scopus 로고
    • R.E. Burkard, R.A. Cuninghame-Green. Private communication
  • 8
    • 0043031396 scopus 로고    scopus 로고
    • On the complexity of computing the coefficients of max-algebraic characteristic polynomial and characteristic equation
    • Butkovič P. On the complexity of computing the coefficients of max-algebraic characteristic polynomial and characteristic equation. Kybernetika 39 2 (2003) 129-136
    • (2003) Kybernetika , vol.39 , Issue.2 , pp. 129-136
    • Butkovič, P.1
  • 10
    • 0041909347 scopus 로고    scopus 로고
    • Calculating essential terms of a characteristic maxpolynomial
    • Butkovič P., and Murfitt L. Calculating essential terms of a characteristic maxpolynomial. CEJOR 8 (2000) 237-246
    • (2000) CEJOR , vol.8 , pp. 237-246
    • Butkovič, P.1    Murfitt, L.2
  • 14
    • 34047249174 scopus 로고    scopus 로고
    • M. Develin, F. Santos, B. Sturmfels, On the rank of a tropical matrix. ArXiv:math.CO/0312114
  • 15
    • 34047275867 scopus 로고    scopus 로고
    • E. Gassner, Variants of the assignment and of the transportation problem, Ph.D. Thesis, Graz, 2004
  • 16
    • 0000905183 scopus 로고
    • Linear Algebra of Dioïds: A survey of recent results
    • Gondran M., and Minoux M. Linear Algebra of Dioïds: A survey of recent results. Annals of Discrete Mathematics 19 (1984) 147-164
    • (1984) Annals of Discrete Mathematics , vol.19 , pp. 147-164
    • Gondran, M.1    Minoux, M.2
  • 17
    • 34047246079 scopus 로고    scopus 로고
    • S.C. Lewis, On the best pricipal submatrix problem, Ph.D. Thesis, University of Birmingham (submitted for publication)
  • 19
    • 34047248817 scopus 로고
    • van Leeuwen J. (Ed), Elsevier, Amsterdam, Oxford MIT Press, Cambridge, MA
    • In: van Leeuwen J. (Ed). Graph Algorithms. Handbook of Theoretical Computer Science: Algorithms and Complexity vol. A (1990), Elsevier, Amsterdam, Oxford 525-631 MIT Press, Cambridge, MA
    • (1990) Handbook of Theoretical Computer Science: Algorithms and Complexity , vol.A , pp. 525-631
  • 20
    • 34047268835 scopus 로고
    • North Holland, Amsterdam
    • Zimmermann U. Linear and Combinatorial Optimization in Ordered Algebraic Structures. Annals of Discrete Mathematics vol. 10 (1981), North Holland, Amsterdam
    • (1981) Annals of Discrete Mathematics , vol.10
    • Zimmermann, U.1


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