搜索资源列表
0-1package
- 0-1背包问题的分支限界算法实现,有详细的函数功能说明 -0-1 knapsack problem branch and bound algorithm, a detailed descr iption of the function function
huishufa
- 用分支限界法求界旅行商问题,用C++语言编程实现-Using branch and bound method profession traveling salesman problem, using C Language Programming
tax
- 介绍了分支限界算法,给出了流程图,伪代码,及源程序,清楚,完整-Introduce a branch and bound algorithm, gives the flow chart, pseudo code, and source code, clear and complete
Algorithm_Design
- 算法设计与分析,其中包括贪婪算法、分而治之算法、动态规划、回溯、分枝定界-Algorithm design and analysis, including greedy algorithms, divide and conquer algorithms, dynamic programming, backtracking, branch and bound
Branch_Bound_Knap
- 分支限界背包算法实现,用VC++6.0开发。-Branch and bound algorithm backpack with VC++ 6.0 development.
LCKNAP
- 01背包问题的优先队列式分枝限界算法程序LCKNAP-01 knapsack problem the priority queue algorithm Branch and Bound-style program LCKNAP
suanfa
- 第1章 算法引论 第2章 递归与分治策略 第3章 动态规划 第4章 贪心算法 第5章 回溯法 第6章 分支限界法 -Chapter 1 Introduction Algorithm Chapter 2 Recursion and sub-rule strategy in Chapter 3 Dynamic Programming Chapter 4 greedy algorithm in Chapter 5 Ba
tsp
- 用分支定界法求解旅行商问题旅行商问题是一个经典NP问题:有n个城市,一个推销员要从其中的某一个城市出发,每个城市只能遍历一次,要求走遍所有的城市,再回到他出发的城市,求所有可能路径中路径最短的一条路径来。-Using branch and bound method for solving traveling salesman problem traveling salesman problem is a classic NP probl
MATLAB
- MATLAB分支定界法求解,大家-MATLAB branch and bound method, U.S.
beibao
- 背包问题 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~ -Knapsack problem using Branch and Bound method to solve 0/1 Knapsack Problem! My internship on the machine operation, through the teacher acceptance, quali
BNB18
- 这是非线性整数规划模型求解分支定界迭代算法-This is a non-linear integer programming model to solve iterative algorithm branch and bound
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
branch_and_board
- 在模式识别应用中,用分支定界法(branch-and-board method)进行特征的选择。该程序在matlab环境下实现了该算法,以从六个特征中选择两个最佳特征为例-In pattern recognition applications, using branch and bound method (branch-and-board method) to carry out the characteristics of choic
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档,包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
shortest-way-java
- 分支限界法 单源最短路径问题的 JAVA实现 3个源文件-Branch and bound method single-source shortest path problem JAVA realization of 3 source files
01beibao
- 01背包问题,里面有四种算法,分别为动态规划,分支限定发,回溯法和谈新算法!-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
suanfashejiyufenxi
- 计算机算法设计与分析实验报告:6大算法详细实验报告(相当详细).分治,动态规划,贪心,回溯,分支限界-Computer Algorithm Design and Analysis of Experimental Report: 6 large algorithm experiment detailed report (in considerable detail). Sub-rule, dynamic programming, gree
Fac6_3
- //本程序取自王晓东编著“算法分析与设计”第 198 页,例 //装载问题的分支限界解法-//This procedure Xiaodong edited from the Algorithm Analysis and Design, p. 198, for example,// load the problem branch and bound method
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