高级检索

    混合算法求解着色瓶颈旅行商问题

    董学士 董文永 蔡永乐

    董学士, 董文永, 蔡永乐. 混合算法求解着色瓶颈旅行商问题[J]. 计算机研究与发展, 2018, 55(11): 2372-2385. doi: 10.7544/issn1000-1239.2018.20180009
    引用本文: 董学士, 董文永, 蔡永乐. 混合算法求解着色瓶颈旅行商问题[J]. 计算机研究与发展, 2018, 55(11): 2372-2385. doi: 10.7544/issn1000-1239.2018.20180009
    Dong Xueshi, Dong Wenyong, Cai Yongle. Hybrid Algorithm for Colored Bottleneck Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2018, 55(11): 2372-2385. doi: 10.7544/issn1000-1239.2018.20180009
    Citation: Dong Xueshi, Dong Wenyong, Cai Yongle. Hybrid Algorithm for Colored Bottleneck Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2018, 55(11): 2372-2385. doi: 10.7544/issn1000-1239.2018.20180009

     

                     

                  

                         

                     

                        

    •  
    •  
    •  
    •  
    •  
    •  
    •  

    /

    返回文章
    返回