搜索资源列表
Hamilton
- 简单写了个一个哈密顿回路，里面添加了分支限界。这是一个全遍历的，用邻接矩阵存储的。正常情况跑17个节点-Wrote a simple loop of a Hamiltonian, which added a branch and bound. This is a full-ergodic, with adjacency matrix storage. Normally run 17 nodes
FlowShop
- 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categorie
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
yy
- 求用分支限界算法解决旅行商问题的源程序,#include <stdio.h> #include <stdlib.h> #include <math.h> #define TRUE (1) #define FALSE (0) #define MAX_CITIES (10) #define INFINITY (999) #define I INFINITY -S
suanfashejiyufenxi
- 计算机算法设计与分析实验报告:6大算法详细实验报告(相当详细).分治,动态规划,贪心,回溯,分支限界-Computer Algorithm Design and Analysis of Experimental Report: 6 large algorithm experiment detailed report (in considerable detail). Sub-rule, dynamic programming, gree
qkw_MaxClique
- //最大团问题的分支限界解法 //屈克文，2008.12.01-//The largest branch of the problem Mission Bound Solution// flexor Rudd, 2008.12.01
lc
- 01背包问题，用lc分支限界方法，做的ppt-01 knapsack problem, using lc branch and bound method, do ppt
fenzhi
- 通过分支限界的方法，求解1到n的最短路径。设数组a保存图的邻接矩阵，0-9号，共10个节点。节点1为源点，n为目标点.-Through the branch and bound approach for solving 1 to n shortest path. A preservation plan for an array of adjacency matrix ,0-9, a total of 10 nodes. Node 1 i
shortestpaths
- 一个不错的源码，关于分支限界求单源最短路径,java，推荐给大家共享，希望能相互学习-A good source, on the branch and bound for single-source shortest path, java, recommend to all to share, hoping to learn from each other
bag
- 分支限界法解决0/1背包问题，用c++的优先队列方法-Branch and bound method to solve 0/1 knapsack problem, using c++ Priority queue method
NN_V1.1
- 使用R-tree和分支限界方法解决N维NN问题，带报告。带数据生成器和R-TREE模板。-The use of R-tree and branch and bound method to solve N-dimensional NN problem with the report. With the data generator and R-TREE template.
d_function
- 分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.
0-1
- 分支限界法 0/1背包问题 程序 分支限界法 0/1背包问题 程序
BABA
- TSP问题的求解，分支限界，利用分支限界求TSP问题-TSP Soulution using branch and bound
game1
- 分支限界法算法作业：图形变换问题解题报告和源代码。问题描述：给定2个4×4方格阵列组成的图形A和B,每个方格颜色为黑色或白色。方格阵列中有公共边的方格称为相邻方格。图形变换问题的每一步可以交换相邻方格的颜色。试设计一个队列式分支限界算法，计算最少需要多少步变换，才能将图形A变换成图形B。-Branch and bound algorithm operation: graphics transform the issue of probl
Knapsack
- 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
FriendGame
- 七彩连珠游戏，分支限界算法实现，简单易用，不是GDI+编程，界面过于简单-Game
FenziJieding
- 分支限界法类似于回溯法，也是一种在问题的解空间树T上搜索问题解的算法-Branch and bound method is similar to retroactive law, is also a solution in the problem search space tree T on the issue of solution algorithm
backpackbranchandbound
- 这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
a
- 用分支限界方法求解最淡哈密顿回路，可以球接到30以上-Using branch and bound method for solving the most light Hamiltonian circuit, you can receive the ball for more than 30