메뉴 건너뛰기




Volumn 165, Issue , 2014, Pages 130-145

Combined location and routing problems for drug distribution

Author keywords

Branch and price; Column generation; Location routing

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING;

EID: 84893758329     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2013.07.016     Document Type: Article
Times cited : (43)

References (22)
  • 1
    • 76749148362 scopus 로고    scopus 로고
    • Scip: Solving constraint integer programs
    • T. Achterberg Scip: solving constraint integer programs Mathematical Programming Computation 1 1 2009 1 41 http://mpc.zib.de/index.php/MPC/article/ view/4
    • (2009) Mathematical Programming Computation , vol.1 , Issue.1 , pp. 1-41
    • Achterberg, T.1
  • 2
    • 81455135706 scopus 로고    scopus 로고
    • New route relaxation and pricing strategies for the vehicle routing problem
    • R. Baldacci, A. Mingozzi, and R. Roberti New route relaxation and pricing strategies for the vehicle routing problem Operations Research 59 2011 1269 1283
    • (2011) Operations Research , vol.59 , pp. 1269-1283
    • Baldacci, R.1    Mingozzi, A.2    Roberti, R.3
  • 3
    • 81455141797 scopus 로고    scopus 로고
    • An exact method for the capacitated location-routing problem
    • R. Baldacci, A. Mingozzi, and R. Wolfler-Calvo An exact method for the capacitated location-routing problem Operations Research 59 2011 1284 1296
    • (2011) Operations Research , vol.59 , pp. 1284-1296
    • Baldacci, R.1    Mingozzi, A.2    Wolfler-Calvo, R.3
  • 5
    • 79955967127 scopus 로고    scopus 로고
    • A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows
    • A. Bettinelli, A. Ceselli, and G. Righini A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows Transportation Research Part C: Emerging Technologies 19 5 2011 723 740
    • (2011) Transportation Research Part C: Emerging Technologies , vol.19 , Issue.5 , pp. 723-740
    • Bettinelli, A.1    Ceselli, A.2    Righini, G.3
  • 7
    • 84893787049 scopus 로고    scopus 로고
    • Modeling and solving profitable location and distribution problems
    • in press (available online)
    • A. Ceselli, G. Righini, and E. Tresoldi Modeling and solving profitable location and distribution problems Optimization Letters 2012 in press (available online)
    • (2012) Optimization Letters
    • Ceselli, A.1    Righini, G.2    Tresoldi, E.3
  • 10
    • 70449635850 scopus 로고    scopus 로고
    • Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows
    • G. Desaulniers, F. Lessard, and A. Hadjar Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows Transportation Science 42 2008 387 404
    • (2008) Transportation Science , vol.42 , pp. 387-404
    • Desaulniers, G.1    Lessard, F.2    Hadjar, A.3
  • 12
    • 4644250559 scopus 로고    scopus 로고
    • An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
    • D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems Networks 44 3 2004 216 229
    • (2004) Networks , vol.44 , Issue.3 , pp. 216-229
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3    Gueguen, C.4
  • 13
    • 33748591592 scopus 로고    scopus 로고
    • The shortest path problem with resource constraints and k-cycle elimination for k = 3
    • S. Irnich, and D. Villeneuve The shortest path problem with resource constraints and k-cycle elimination for k = 3 INFORMS Journal on Computing 18 2006 391 406
    • (2006) INFORMS Journal on Computing , vol.18 , pp. 391-406
    • Irnich, S.1    Villeneuve, D.2
  • 14
    • 61449183550 scopus 로고    scopus 로고
    • Subset-row inequalities applied to the vehicle-routing problem with time windows
    • M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger Subset-row inequalities applied to the vehicle-routing problem with time windows Operations Research 56 2 2008 497 511
    • (2008) Operations Research , vol.56 , Issue.2 , pp. 497-511
    • Jepsen, M.1    Petersen, B.2    Spoorendonk, S.3    Pisinger, D.4
  • 19
    • 51349129806 scopus 로고    scopus 로고
    • New dynamic programming algorithms for the resource constrained elementary shortest path problem
    • G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained elementary shortest path problem Networks 51 3 2008 155 170
    • (2008) Networks , vol.51 , Issue.3 , pp. 155-170
    • Righini, G.1    Salani, M.2
  • 20
    • 71949099703 scopus 로고    scopus 로고
    • A two-stage vehicle routing model for large-scale bioterrorism emergencies
    • Z. Shen, F. Ordonez, and M. Dessouky A two-stage vehicle routing model for large-scale bioterrorism emergencies Networks 54 4 2009 255 269
    • (2009) Networks , vol.54 , Issue.4 , pp. 255-269
    • Shen, Z.1    Ordonez, F.2    Dessouky, M.3


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