메뉴 건너뛰기




Volumn 153, Issue 1, 2007, Pages 3-7

Eleven surveys in Operations Research

Author keywords

[No Author keywords available]

Indexed keywords


EID: 34250203889     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0168-2     Document Type: Article
Times cited : (8)

References (13)
  • 2
    • 77950343748 scopus 로고    scopus 로고
    • Design issues for combinatorial auctions
    • Abrache, J., Crainic, T. G., & Gendreau, M. (2004). Design issues for combinatorial auctions. 4OR, 2(1), 1-33.
    • (2004) 4OR, 2 , Issue.1 , pp. 1-33
    • Abrache, J.1    Crainic, T.G.2    Gendreau, M.3
  • 3
    • 33745382172 scopus 로고    scopus 로고
    • Combinatorial optimization and hierarchical classifications
    • Barthélemy, J.-P., Brucker, F., & Osswald, C. (2004). Combinatorial optimization and hierarchical classifications. 4OR, 2(3), 179-219.
    • (2004) 4OR, 2 , Issue.3 , pp. 179-219
    • Barthélemy, J.-P.1    Brucker, F.2    Osswald, C.3
  • 6
    • 34250174582 scopus 로고    scopus 로고
    • Ethics in OR/MS: Past, present and future
    • Brans, J.-P., & Gallo, G. (2004). Ethics in OR/MS: Past, present and future. 4OR, 2(2), 95-110.
    • (2004) 4OR, 2 , Issue.2 , pp. 95-110
    • Brans, J.-P.1    Gallo, G.2
  • 7
    • 27744459902 scopus 로고    scopus 로고
    • Bilevel programming: A survey
    • Colson, B., Marcotte, P., & Savard, G. (2005). Bilevel programming: A survey. 4OR, 3(2), 87-107.
    • (2005) 4OR, 3 , Issue.2 , pp. 87-107
    • Colson, B.1    Marcotte, P.2    Savard, G.3
  • 8
    • 84891645206 scopus 로고    scopus 로고
    • The dial-a-ride problem (DARP): Variants, modeling issues and algorithms
    • Cordeau, J.-F., & Laporte, G. (2003). The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. 4OR, 1(2), 89-101.
    • (2003) 4OR, 1 , Issue.2 , pp. 89-101
    • Cordeau, J.-F.1    Laporte, G.2
  • 9
    • 26444618722 scopus 로고    scopus 로고
    • Complexity and algorithms for convex network optimization and other nonlinear problems
    • Hochbaum, D. S. (2005). Complexity and algorithms for convex network optimization and other nonlinear problems. 4OR, 3(3), 171-216.
    • (2005) 4OR, 3 , Issue.3 , pp. 171-216
    • Hochbaum, D.S.1
  • 10
    • 84891645442 scopus 로고    scopus 로고
    • The omnipresence of Lagrange
    • Lemaréchal, C. (2003). The omnipresence of Lagrange. 4OR, 1(1), 7-25.
    • (2003) 4OR, 1 , Issue.1 , pp. 7-25
    • Lemaréchal, C.1
  • 11
    • 84891649175 scopus 로고    scopus 로고
    • Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
    • Louveaux, Q., & Wolsey, L. A. (2003). Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR, 1(3), 173-207.
    • (2003) 4OR, 1 , Issue.3 , pp. 173-207
    • Louveaux, Q.1    Wolsey, L.A.2
  • 12
    • 29144447714 scopus 로고    scopus 로고
    • Production planning with load dependent lead times
    • Pahl, J., Voß, S., & Woodruff, D. L. (2005). Production planning with load dependent lead times. 4OR, 3(4), 257-302.
    • (2005) 4OR, 3 , Issue.4 , pp. 257-302
    • Pahl, J.1    Voß, S.2    Woodruff, D.L.3
  • 13
    • 18844395365 scopus 로고    scopus 로고
    • Counting and enumeration complexity with application to multicriteria scheduling
    • T'kindt, V., Bouibede-Hocine, K., & Esswein, C. (2005). Counting and enumeration complexity with application to multicriteria scheduling. 4OR, 3(1), 1-21.
    • (2005) 4OR, 3 , Issue.1 , pp. 1-21
    • T'kindt, V.1    Bouibede-Hocine, K.2    Esswein, C.3


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