Author:
Rong Ziheng,Gong Xiaoling,Wang Xiangyu,Lv Wei,Wang Jian
Publisher
Springer International Publishing
Reference37 articles.
1. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. 2(23), 555–565 (1979)
2. Gutin, G., Punnen, A.: The traveling salesman problem and its variations. Paradigms Comb. Optim. Probl. 4(2), 193–205 (2007)
3. Arigliano, A., Calogiuri, T., Ghiani, G.: A branch-and-bound algorithm for the time-dependent travelling salesman problem. Networks 72(3) (2018)
4. Lecture Notes in Computer Science;H Hernández-Pérez,2018
5. Wang, H.Q., Huang, D.S., Wang, B.: Optimisation of radial basis function classifiers using simulated annealing algorithm for cancer classification. Electron. Lett. 41(11), 630–632 (2005)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献