医疗电子技术网|技术阅读
登录|注册

您现在的位置是:医疗电子技术网 > 资源下载 > matlab例程 > TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect

TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect

资 源 简 介

TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem.

相 关 资 源