Author:
Liu Jian-Feng,Wang Zi-Hao,Zhang Wei,Zhang Chao-Rui,Hou Jian-Feng,Bai Bo,Zhang Gong
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference50 articles.
1. Held, M., Karp, R.M.: The traveling-Salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138–1162 (1970)
2. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, Part I: the chinese postman problem. Oper. Res. 43(2), 231–242 (1995)
3. McFarlane, D., Giannikas, V., Lu, W.: Intelligent logistics: involving the customer. Comput. Ind. 81, 105–115 (2016)
4. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The traveling Salesman problem: a computational study. Princeton University Press, USA (2006)
5. Held, S., Müller, D., Rotter, D., Scheifele, R., Traub, V., Vygen, J.: Global routing with timing constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(2), 406–419 (2017)