文件名称:traveller-problem-1-
介绍说明--下载内容来自于网络,使用问题请自行百度
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
traveller problem-1-/
traveller problem-1-/fonctions.h
traveller problem-1-/graphe11.txt
traveller problem-1-/main (2).c
traveller problem-1-/makefile.txt
traveller problem-1-/READ ME.txt
traveller problem-1-/structures.h
traveller problem-1-/test1.c
traveller problem-1-/test2.c
traveller problem-1-/fonctions.h
traveller problem-1-/graphe11.txt
traveller problem-1-/main (2).c
traveller problem-1-/makefile.txt
traveller problem-1-/READ ME.txt
traveller problem-1-/structures.h
traveller problem-1-/test1.c
traveller problem-1-/test2.c
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.