![Open access](/images/ico/o.png)
![](/images/ico/ico5.png)
Author: Fischer Anja Fischer Frank Jäger Gerold Keilwagen Jens Molitor Paul Grosse Ivo
Publisher: MDPI
E-ISSN: 2079-3197|3|2|285-298
ISSN: 2079-3197
Source: Computation, Vol.3, Iss.2, 2015-06, pp. : 285-298
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/o.png)
![](/images/ico/ico5.png)
Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem
By Xu Shuhui Wang Yong Huang Aiqin
Algorithms, Vol. 7, Iss. 2, 2014-05 ,pp. :
![](/images/ico/o.png)
![](/images/ico/ico5.png)
Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach
By Isaacs Jason T. Hespanha João P.
Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. :
![](/images/ico/o.png)
![](/images/ico/ico5.png)
Exact Algorithms for Maximum Clique: A Computational Study
Algorithms, Vol. 5, Iss. 4, 2012-11 ,pp. :
![](/images/ico/o.png)
![](/images/ico/ico5.png)