메뉴 건너뛰기




Volumn 50, Issue 3, 2002, Pages 415-423

An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; RANDOM PROCESSES; SET THEORY; TRANSPORTATION;

EID: 0036563024     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.50.3.415.7751     Document Type: Article
Times cited : (233)

References (27)
  • 10
    • 0027908976 scopus 로고
    • Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
    • (1993) Eur. J. Oper. Res. , vol.64 , pp. 432-441
    • Dror, M.1
  • 13
    • 0028461566 scopus 로고
    • Optimal solution of vehicle routing problems using minimum k-trees
    • (1994) Oper. Res. , vol.42 , Issue.4 , pp. 626-642
    • Fisher, M.L.1
  • 24
    • 0003741380 scopus 로고    scopus 로고
    • Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands
    • Ph.D. dissertation, Faculty of the College of Business Administration, University of Houston, Houston, TX
    • (1998)
    • Secomandi, N.1


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