An efficient transformation of the generalized vehicle routing problem
暂无分享,去创建一个
[1] Gilbert Laporte,et al. Location routing problems , 1987 .
[2] Bruce L. Golden,et al. VEHICLE ROUTING: METHODS AND STUDIES , 1988 .
[3] Gilbert Laporte,et al. AN ALGORITHM FOR THE DESIGN OF MAILBOX COLLECTION ROUTES IN URBAN AREAS , 1989 .
[4] James C. Bean,et al. A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..
[5] J. C. Bean,et al. An efficient transformation of the generalized traveling salesman problem , 1993 .
[6] Thomas L. Morin,et al. A branch-and-cut algorithm for vehicle routing problems , 1994, Ann. Oper. Res..
[7] Matteo Fischetti,et al. The symmetric generalized traveling salesman polytope , 1995, Networks.
[8] Bruce L. Golden,et al. Chapter 5 Arc routing methods and applications , 1995 .
[9] Gilbert Laporte,et al. Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..
[10] Michel Gendreau,et al. Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..
[11] Gilbert Laporte,et al. Some Applications of the Generalized Travelling Salesman Problem , 1996 .
[12] Matteo Fischetti,et al. A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..
[13] Gilbert Laporte,et al. A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..