搜索资源列表
课程设计-旅行计划1
- 数据结构课程设计-curriculum design data structures!
chcp
- 图论算法，旅行推销员问题，很有趣。 可算出图中的哈米尔顿回路-graph algorithm, traveling salesman problem, very interesting. Map can be calculated totally dominated the circuit
旅行预订系统
- 用VC实现的一个简单的旅行预订系统，后台数据库是Access。含有简单的设计文档-with VC of a simple travel booking system is Access database background. With a simple design documents
lvxing
- 很好的一个关于算法中旅行售货的vc编程，对于学习windows编程又很大帮主-on a good algorithm travel Perhaps vc programming, learning Windows programming another great leader.
bs
- 基于B/S架构的汽车俱乐部管理系统的开发— 旅行服务的源代码，值得一看啊-based on B / S structure of the Automobile Club management system development-travel service source code, an eye-catcher ah
tsptsp
- 用C++编写的旅行售货员问题,采用的是回朔算法,对初学算法设计的人很有帮助哦!-prepared by the travel salesman, using the back Schomburg algorithm, algorithm design for beginners who helpful Oh!
mathmodel2
- 1.1 背包问题 有一个徒步旅行者，已知他能承受的旅行背包的重量不超过a（kg）。设有n种物品可供他选择装入背包，这n种物品分别编号为1，2，…，n。其中第i种物品每件的重量为ai（kg），其使用价值（指一件第i种物品对旅行者来说所带来的好处的一种数量指标）为ci（i＝1，2，…，n）。问这位旅行者应如何选择携带这n种物品的件数，使得总价值最大？ -1.1 knapsack problem is a hikers. he is known to travel to withstand t
Agent_simple
- 实现了一个小的agent，主要采用的是java中的对象序列化，借鉴了agent的基本原理，比如旅行计划，agent名设计等。-achieved a small agent, the java is the target sequence, Drawing on the basic tenets of the agent, such as travel plans, the agent who design.
TSPinmatlab
- 用遗传算法解决城市的访问次序，可使其 旅行路线的总长度最短 可从该程序借鉴到其他应用 -using genetic algorithms to solve the city for the visit, travel routes can make the total length of the shortest can draw from the procedures of other applications
TSPprogrammatlab
- 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, finally starting to return to t
JSPzzj
- 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市 只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其 旅行路线的总长度最短？ -known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, finally starting to r
traveljinshi
- 旅行售货员问题的近似算法 数据结构 算法 NP完全问题-traveling salesman problem approximation algorithm data structure algorithms NP-complete problem
旅行售货员问题
- 旅行售货员问题的解是一棵排列树．在给出的图中寻找一条费用最优的回路-travel salesman problem is the solution with a tree. The plan is to find an optimal cost of the Loop
旅行代理
- 数据库的课程设计,一个旅行代理系统,做得很简单,但是交差够了,-database of curriculum design, a travel agent system, so very simple, but, given enough, huh
解旅行售货员问题的优先队列式分支限界法
- 解决旅行售货员问题的优先队列式分支限界法C++源程序
TSP
- 介绍求解TSP 问题的蚁群算法，是解决旅行售货员问题的一种比较好的方法-Introduced to solve the ant colony algorithm for TSP problem is to solve the traveling salesman problem of a better way to
蚁群、路径规划
- 这是一个关于使用蚁群算法的旅行路径规划问题的MATLAB优化程序(ant colony algorithm)
基于QT实现的旅行模拟查询系统.7z
- 本软件旨在根据旅客的要求设计出行路线并输出，同时系统能模拟旅客所在的地点和状态，目标为为旅客提供能完美的出行计划。(The purpose of this software is to design and output travel routes according to passengers'requirements. At the same time, the system can simulate the location and status of passengers. The go
基于QT实现的旅行模拟查询系统
- qt实现旅行查询，计算机学院大作业，采用BFS算法实现(Implementation of data structure knapsack algorithm)