搜索资源列表
wwe
- 关于垃圾运输问题中的程序设计，包括寻找最小哈密顿环问题-With regard to refuse transport of program design, including the issue of finding the minimum Hamiltonian ring
one
- 求解最短哈密顿回路，先用贪心方法求解一个路径及权值，以此作为回溯剪枝界。-Solving the shortest Hamiltonian circuit, first with the greedy method to solve a path and weight, as a back pruning sector.
a
- 用分支限界方法求解最淡哈密顿回路，可以球接到30以上-Using branch and bound method for solving the most light Hamiltonian circuit, you can receive the ball for more than 30
Hamiltonian
- 一个求最邮哈密顿回路算法,很好用，适合作业-a harmiton algorithmic
hamliton
- 此程序通过回溯的方法求解最短哈密顿回路问题-This program through the back of the method for solving the shortest Hamiltonian circuit problem
findH
- 用分支限界法实现n比较大时（n>100)找最优哈密顿回路。-Using branch and bound method to achieve relatively large n, when (n> 100) to find the optimal Hamiltonian circuit.
Ham
- 给出一个完全图，给出最小哈密顿回路。顶点个数不要超过20.程序自动生成了一个完全图。也可修改输入，自己输入完全图。-Is given a complete graph is given the minimum Hamiltonian circuit. The number of vertices should not exceed 20. Program automatically generates a complete graph. Can also modify the input, yo
hamilton
- 求无向图的是否有哈密顿圈 如果有输出最大哈密顿圈-Undirected graph in order to have Hamiltonian cycle if there is the greatest Hamiltonian cycle output
method
- Two computer programs for solving the Schrodinger equation for bound state eigenvalues and eigenfunctions using the Fourier Grid Hamiltonian
hamiltoniancircuit
- 利用 c++ 实现 棋盘的哈密顿回路问题-usec++tosolute the problem of hamiltonian circuit
hamidun
- 实现哈密顿回路，在VC6.0调试过的程序，没有错误，供大家参考学习。-Realize the Hamiltonian loop, the program in VC6.0 debugging, no error, provide everyone reference to study.
TSP
- Descr iption 给定一个完全无向带权图G，其每一条边有一个非负的整数权值。目的是要找出G的一条经过每个顶点一次且仅经过一次的回路，使回路的总权值最小。 请设计一个2-近似算法，求出近似最小的总权值，即定义最优解为C，只要输出解在[C , 2 * C]的范围内都可以“Accept”。 Input 输入第一行为一个正整数n(1 <= n <= 20)，表示G中顶点的个数。接下来n行每行包括n个整数，第i行第j个的整数表示G中第i个点
Thamlitonh
- 此程序通过回溯的方法法求解最短哈密顿回路问题 -This program by the backtracking method for solving the shortest Hamiltonian circuit problem
hamilton_code
- 使用C++语言实现哈密顿回路的程序，是原创哦！-Procedures to use C++ language Hamiltonian loop, original Oh!
gRAPH
- 这是图论课程设计 生成哈密顿回路 有源码 报告和注释-This is the graph theory courses designed to generate a Hamiltonian circuit source report and comments
TSP-simulated-annealing-algorithm
- 应用于哈密顿回路的TSP模拟退火算法，里面有6个m文件-Hamiltonian circuit used in the TSP simulated annealing algorithm, which has a 6 m files
ShiWuSuDi
- 食物速递服务，哈密顿图，最短路径，满足条件，NP问题,深度优先搜索。-Food Delivery Service, Hamiltonian, shortest path, to meet the conditions, NP problems, depth-first search.
LINGO1
- 基于TSP模型的哈米尔顿圈算法，用lingo实现。本程序在lingo11上编写-TSP-based model Hamiltonian cycles algorithm, using lingo implementation. The program is written on lingo11
fluid-and-hamilton
- fluid and hamiltonian
gpops(hamiltonian)
- 大部分GPOPS工具包都不包含哈密顿函数，本文在上述基础上，增加了哈密顿函数的求解，方便显示和验证结果的最优性！-Most GPOPS kit does not include the Hamiltonian function, in this paper, based on the above, the increase in the solution of the Hamiltonian function, convenient optimal display and verify the