搜索资源列表
55
- 背包问题分枝界限算法的源代码 其中包括背包容量、下限、剩余容量、当前价值之和 等-Branch-and-bound algorithm for knapsack problem of the source code including backpack capacity, the lower limit, the remaining capacity, the current value and so on
fenzhidingjieMATLAB
- 分枝定界法求解整数规划的MATLAB实现-Branch and Bound Method for Solving Integer Programming MATLAB to achieve
bag
- 分支限界法解决0/1背包问题,用c++的优先队列方法-Branch and bound method to solve 0/1 knapsack problem, using c++ Priority queue method
che
- 问题描述:按照国际象棋的规则,车可以攻击与之处在同一行或同一列上的棋子。指南车是有方向的车。横向指南车可以攻击与之处在同一行上的棋子。纵向指南车可以攻击与之处在同一列上的棋子。指南车问题要求在m×n格的棋盘上放置指南车,并确定各指南车的攻击方向,使棋盘上不受指南车攻击的方格数最多。 编程任务:对于给定的m×n格的棋盘和2 个整数x 和y。整数x 表示棋盘上有x个规定方格应放置指南车,但攻击方向未定。整数y表示除了已规定放置位置的x个指南车外,还要在棋盘上放置y个指南车,其位置和攻击方向
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.
TSP_branch_and_bound_method
- 用来解决旅行商问题 可以直接运行 很好的代码-Used to solve the traveling salesman problem can be directly run a very good code
BNBGUI
- 分支定界算法的GUI版 用来解整数规划问题 相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
distinguish-from
- 讲述了模式识别中特征的提取和特征的转化,及对分支定界的鉴戒-Pattern recognition on the extraction of features and characteristics of the transformation, and the warning of the branch and bound
The_design_of_computer_algorithms
- 全书从算法设计和算法分析的基本概念和方法入手,系统介绍了算法设计方法与分析技巧。全书分为3个部分:第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析;第二部分针对排序问题和图的问题,讨论各种已有的算法,并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法,并介绍了计算的复杂性以及NP完全问题;第三部分讲述并行计算模型和并行算法设计技术。书中每章后面都附有一定数量的习题,帮助读者理解和掌握书中的内容。-Book from the algorithm design a
fenzhixianjie
- 算法分析中,分支限界法的实现,并有完整的测试数据-Algorithm analysis, the achievement of branch and bound method, as well as complete test data
Nhuanghoujianzhi
- N皇后剪枝算法 关键字 回溯,剪枝 ,上界,下界,分支限界-N Queen pruning algorithm for keyword back, pruning, upper bound, lower bound, branch and bound
xianxingzhengshuguihua
- 线性整数规划分支定界算法Matlab源码,算法简单有效-Linear integer programming branch and bound algorithm Matlab source code, algorithm is simple and effective
divide
- 分支定界搜索算法。一种重要的搜索算法,对普通的搜索算法是很好的优化-Branch and bound search algorithm. An important search algorithm, search algorithm on the ordinary is a good optimization
BNB
- 工具箱 (分枝定界法工具箱) matlab 中使用-Toolbox (Toolbox branch and bound method) matlab use
classicAlgorithm
- 常用经典算法及讲解:贪婪,分而治之,动态规划,回溯,分支定界算法实现和讲解。-Classical algorithm and explain common: greed, divide and conquer, dynamic programming, backtracking, branch and bound algorithm and explain.
filldisk-1.01.tar
- filldisk is an utility to optimize filling a media (cd/dvd/others with big files while wasting the minimum amount of space on it. It is an integer binary programming application using a customized branch and bound algorithm which focuses on yes/no
06
- 最优装载方案 成绩: 0 / 折扣: 0.8 试设计一个用队列式分支限界法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数,并将此函数用于解装载问题。 装载问题描述如下:有一批共n个集装箱要装上艘载重量为c的轮船,其中集装箱i的重量为wi 。找出一种最优装载方案,将轮船尽可能装满,即在装载体积不受限制的情况下,将尽可能重的集装箱装上轮船。 输入:第一行有2个正整数n和c。n是集装箱数,c是轮船的载重量 接下来的1行中有n个正整数,表示集装箱的重量
Queen
- 算法分析中的皇后问题,采用分枝限界法进行求解-Algorithm analysis of Queen' s question, the use of Branch and Bound method for solving
CShortestLenPCB
- 采用分枝限界法进行求解最短路径长度的问题,是算法设计中的经典题目-Branch and Bound method used to solve the problem of the shortest path length, is the classic algorithm design topics
maxProfitBBKnapsack
- 用vc++6编写的程序,采用最大收益分枝定界法,解决背包问题。-Vc++6 prepared with the procedure for the maximum benefit from branch and bound method to solve knapsack problem.