搜索资源列表
分支限界算法求解TSP问题
- 本程序用分支界限方法解决ＴＳＰ问题，即旅行商问题．-the procedures used branch line solution to TSP, the traveling salesman problem.
MATLAB 解整数规划 （分支定界)
- matlab解用分支定界法解整数规划的程序。请大家参考-solutions using Matlab branch and bound method for integer programming procedures. Please refer
分支界限法求解货郎担问题
- 研究生算法作业分支界限法求解货郎担问题-graduate algorithm operations branch line Traveling Salesman Problem Solving
分支限界法_单源最短路径
- 算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC + + prepared
分支与界法
- 图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
travelingSalespersonProblem.ra
- 旅行商问题的实现，用分支界限法实现旅行商问题,The realization of traveling salesman problem, and the Limits of Law branch of the realization of traveling salesman problem
DividePlane
- 运筹学中的分支定界法，采用MATLAB编程，比较实用-Operations research branch and bound method, using MATLAB programming, more practical
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 choice. The program in the matlab e
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
TSP
- 本程序通过使用分支限界法实现旅行商问题，成功解决了旅行商问题-This procedure achieved by using the branch and bound traveling salesman problem, successfully solved the traveling salesman problem
sd
- 大家看看 0-1背包的分支界限程序-We look at the 0-1 Knapsack procedures branch boundaries
Fac6_3
- //本程序取自王晓东编著“算法分析与设计”第 198 页，例 //装载问题的分支限界解法-//This procedure Xiaodong edited from the Algorithm Analysis and Design, p. 198, for example,// load the problem branch and bound method
che
- 问题描述：按照国际象棋的规则，车可以攻击与之处在同一行或同一列上的棋子。指南车是有方向的车。横向指南车可以攻击与之处在同一行上的棋子。纵向指南车可以攻击与之处在同一列上的棋子。指南车问题要求在m×n格的棋盘上放置指南车，并确定各指南车的攻击方向，使棋盘上不受指南车攻击的方格数最多。 编程任务：对于给定的m×n格的棋盘和2 个整数x 和y。整数x 表示棋盘上有x个规定方格应放置指南车，但攻击方向未定。整数y表示除了已规定放置位置的x个指南车外，还要在棋盘上放置y个指南车，其位置和攻击方向
optimal-decision
- 最优决策——用几个matlab编程的实例阐述分支定界法的思想是：首先确定目标值的上下界-Optimal decision-making- matlab programming with some examples of the branch and bound method is the idea: First, determine the target of the upper and lower bounds
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
classicAlgorithm
- 常用经典算法及讲解：贪婪，分而治之，动态规划，回溯，分支定界算法实现和讲解。-Classical algorithm and explain common: greed, divide and conquer, dynamic programming, backtracking, branch and bound algorithm and explain.
分支定界法
- 分支定界法，可以求解线性规划问题，用matlab解决，感觉不错(Branch and bound method can be used to solve linear programming problems)