Heuristic algorithms for the multi-depot ring-star problem
暂无分享,去创建一个
[1] Mauro Dell'Amico,et al. Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.
[2] Fred W. Glover,et al. Tabu Search , 1997, Handbook of Heuristics.
[3] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[4] Gilbert Laporte,et al. Path, Tree and Cycle Location , 1998 .
[5] Gilbert Laporte,et al. Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.
[6] Jiefeng Xu,et al. Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search , 1999 .
[7] Gilbert Laporte,et al. A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .
[8] John E. Beasley,et al. The Vehicle Routing-Allocation Problem: A unifying framework , 1996 .
[9] Inmaculada Rodríguez Martín,et al. Locating median cycles in networks , 2005, Eur. J. Oper. Res..
[10] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[11] Mauro Dell'Amico,et al. The Capacitated m-Ring-Star Problem , 2007, Oper. Res..
[12] Teodor Gabriel Crainic,et al. Fleet management and logistics , 1998 .
[13] 이용호,et al. A Branch and Cut Algorithm for the Steiner Ring Star Problem , 1998 .
[14] Inmaculada Rodríguez Martín,et al. The Ring Star Problem: Polyhedral analysis and exact algorithm , 2004, Networks.
[15] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[16] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .