The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...
The Journal of the Operational Research Society, Vol. 66, No. 4 (APRIL 2015), pp. 615-626 (12 pages) We introduce and study the Travelling Salesman Problem with Multiple Time Windows and Hotel ...
一些您可能无法访问的结果已被隐去。
显示无法访问的结果
反馈