Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search
暂无分享,去创建一个
[1] Roberto Baldacci,et al. An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections , 2003, Networks.
[2] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[3] Aliza Main,et al. The travelling salesman problem , 1996 .
[4] M. Goetschalckx,et al. The vehicle routing problem with backhauls , 1989 .
[5] Daniele Vigo,et al. Heuristics for the traveling salesman problem with pickup and delivery , 1999, Comput. Oper. Res..
[6] Paolo Toth,et al. Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..
[7] Irina Gribkovskaia,et al. MODELS FOR PICK-UP AND DELIVERIES FROM DEPOTS WITH LASSO SOLUTIONS , 2001 .
[8] Gur Mosheiov,et al. The Travelling Salesman Problem with pick-up and delivery , 1994 .
[9] Michel Gendreau,et al. A Survey of Heuristics for the Vehicle Routing Problem Part I: Basic Problems and Supply Side Extensions , 2008 .
[10] Said Salhi,et al. An investigation into a new class of vehicle routing problem with backhauls , 2002 .
[11] Fred W. Glover,et al. Adaptive memory search for Boolean optimization problems , 2004, Discret. Appl. Math..
[12] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.
[13] Brian W. Kernighan,et al. AMPL: A Modeling Language for Mathematical Programming , 1993 .