메뉴 건너뛰기




Volumn 6, Issue 2, 2009, Pages 251-267

Stochastic optimization models for a single-sink transportation problem

Author keywords

Scenario trees; Single sink transportation problem; Stochastic programming

Indexed keywords


EID: 63949085353     PISSN: 1619697X     EISSN: 16196988     Source Type: Journal    
DOI: 10.1007/s10287-008-0086-z     Document Type: Article
Times cited : (19)

References (10)
  • 1
    • 16244412317 scopus 로고    scopus 로고
    • A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem
    • Alidaee B, Kochenberger GA (2005) A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem. Transp Sci 39(1):140-143
    • (2005) Transp Sci , vol.39 , Issue.1 , pp. 140-143
    • Alidaee, B.1    Kochenberger, G.A.2
  • 4
    • 0034559151 scopus 로고    scopus 로고
    • Scenarios for multistage stochastic programs
    • Dupačová J, Consigli G, Wallace SW (2000) Scenarios for multistage stochastic programs. Ann Oper Res 100(1-4):25-53
    • (2000) Ann Oper Res , vol.100 , Issue.1-4 , pp. 25-53
    • Dupačová, J.1    Consigli, G.2    Wallace, S.W.3
  • 5
    • 0030290035 scopus 로고    scopus 로고
    • Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation
    • Herer YT, Rosenblatt MJ, Hefter I (1996) Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation. Transp Sci 30:276-290
    • (1996) Transp Sci , vol.30 , pp. 276-290
    • Herer, Y.T.1    Rosenblatt, M.J.2    Hefter, I.3
  • 7
    • 34248677663 scopus 로고    scopus 로고
    • Evaluation of scenario generation methods for stochastic programming
    • Kaut M, Wallace SW (2007) Evaluation of scenario generation methods for stochastic programming. Pac J Optim 3(2):257-271
    • (2007) Pac J Optim , vol.3 , Issue.2 , pp. 257-271
    • Kaut, M.1    Wallace, S.W.2
  • 8
    • 0031247849 scopus 로고    scopus 로고
    • Revised-modified penalties for fixed charge transportation problems
    • Lamar BW, Wallace CA (1997) Revised-modified penalties for fixed charge transportation problems. Manage Sci 43(10):1431-1436
    • (1997) Manage Sci , vol.43 , Issue.10 , pp. 1431-1436
    • Lamar, B.W.1    Wallace, C.A.2
  • 9
    • 0025455903 scopus 로고
    • A capacity improvement lower bound for fixed charge network design problmes
    • Lamar BW, Sheffi Y, Powell WB (1990) A capacity improvement lower bound for fixed charge network design problmes. Oper Res 38(4):704-710
    • (1990) Oper Res , vol.38 , Issue.4 , pp. 704-710
    • Lamar, B.W.1    Sheffi, Y.2    Powell, W.B.3
  • 10
    • 0000087980 scopus 로고
    • A branch-and-bound method for the fixed charge transportation problem
    • Palekar US, Karwan MH, Zionts S (1990) A branch-and-bound method for the fixed charge transportation problem. Manage Sci 36(9):1092-1105
    • (1990) Manage Sci , vol.36 , Issue.9 , pp. 1092-1105
    • Palekar, U.S.1    Karwan, M.H.2    Zionts, S.3


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