메뉴 건너뛰기




Volumn 29, Issue , 2011, Pages 507-511

A Hybrid Branch-and-Cut Approach for the Capacitated Vehicle Routing Problem

Author keywords

Branch and Cut; Distribution Logistics; Vehicle Routing

Indexed keywords


EID: 79959222118     PISSN: 15707946     EISSN: None     Source Type: Book Series    
DOI: 10.1016/B978-0-444-53711-9.50102-4     Document Type: Book
Times cited : (6)

References (10)
  • 2
    • 8344229228 scopus 로고    scopus 로고
    • An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation
    • Baldacci R., Hadjiconstantinou E., Mingozzi A. An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research 2004, 52(5):723-738.
    • (2004) Operations Research , vol.52 , Issue.5 , pp. 723-738
    • Baldacci, R.1    Hadjiconstantinou, E.2    Mingozzi, A.3
  • 3
    • 45149121178 scopus 로고    scopus 로고
    • An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
    • Baldacci R., Christofides N., Mingozzi A. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming Ser.A, 115 2008, 351-385.
    • (2008) Mathematical Programming Ser.A, 115 , vol.351-385
    • Baldacci, R.1    Christofides, N.2    Mingozzi, A.3
  • 4
    • 76749122240 scopus 로고    scopus 로고
    • Exact algorithms for routing problems under vehicle capacity constraints
    • Baldacci R., Toth P., Vigo D. Exact algorithms for routing problems under vehicle capacity constraints. Annals of Operations Research 2010, 175(1):213-245.
    • (2010) Annals of Operations Research , vol.175 , Issue.1 , pp. 213-245
    • Baldacci, R.1    Toth, P.2    Vigo, D.3
  • 6
    • 73349128424 scopus 로고    scopus 로고
    • Fifty years of vehicle routing
    • Laporte G. Fifty years of vehicle routing. Transportation Science 2009, 43(4):408-416.
    • (2009) Transportation Science , vol.43 , Issue.4 , pp. 408-416
    • Laporte, G.1
  • 7
    • 21144444352 scopus 로고    scopus 로고
    • A new branch-and-cut algorithm for the capacitated vehicle routing problem
    • Lysgaard J., Letchford A.N., Eglese R.W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming Ser.A 2004, 100:423-445.
    • (2004) Mathematical Programming Ser.A , vol.100 , pp. 423-445
    • Lysgaard, J.1    Letchford, A.N.2    Eglese, R.W.3
  • 10
    • 12244261649 scopus 로고    scopus 로고
    • Solving the vehicle routing problem with adaptive memory programming methodology
    • Tarantilis C.D. Solving the vehicle routing problem with adaptive memory programming methodology. Computers and Operations Research 2005, 32(9):2309-2327.
    • (2005) Computers and Operations Research , vol.32 , Issue.9 , pp. 2309-2327
    • Tarantilis, C.D.1


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