搜索资源列表
branch-and-cut-algorithm.rar
- 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。 ,Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is
背包问题用lc分支限界方法
- 01背包问题，用lc分支限界方法，做的ppt-01 knapsack problem, using lc branch and bound method, do ppt
branchandbound
- 分支限界这一章的课件，经典空间，大家交流呀-Branch and bound this chapter courseware, classic space, we exchange it
hamilton
- 用分支与界法解决旅行商问题，c++源代码。十分快速。-With the branch and bound algorithm to solve traveling salesman problem, c++ source code. Very fast.
1234
- 2010最新的用分枝界限法解决最大多样性问题的SCI论文。-This article begins with a review of previously proposed integer formulations for the maximum diversity problem (MDP). This problem consists of selecting a subset of elements from a larger set in such a way that the
a
- 货郎担问题：求解货郎担问题的分枝限界算法-Traveling Salesman Problem: Solving the branch and bound algorithm for Traveling Salesman Problem
xinhaojiance
- 几种 MIMO 最大似然检测算法性能与复杂度比较及改进，介绍了半定松弛、分枝定界和堆栈三种低复杂度最大似然检测算法，并对其性能和复杂度进行了仿真分析，提出了改进的分枝定界和堆栈算法，仿真结果证明分枝定界和堆栈算法性能要优于半定松弛算法，分枝定界算法的复杂度低于堆栈算法且半定松弛算法以多项式复杂度取得了逼近最大似然的性能，同时改进算法加快了算法收敛速度，降低了计算复杂度和对存储空间的要求。 -Several maximum likelihood MIMO detection algorithm
branchandbound
- The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the
0-1bag
- 解决0-1背包问题的几种方法，有回溯，有优先分支界限，是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report
2070
- PDF in HYBRIDIZING GENETIC ALGORITHMS WITH BRANCH AND BOUND TECHNIQUES FOR THE RESOLUTION OF THE TSP,usefu-PDF in HYBRIDIZING GENETIC ALGORITHMS WITH BRANCH AND BOUND TECHNIQUES FOR THE RESOLUTION OF THE TSP,usefull
0_1beibao
- 0_1背包问题的分支定界法算法 希望帮到大家-0_1 branch and bound method for the knapsack problem algorithm
branch-and-bound
- 分支定界法求解TSp问题的分析研究以及matlab实现-Branch and bound method to solve the problem described TSp
Line
- 算法分编程布线问题，常用语机器人布线的代码，采用了分支限界法求解。可以作为辅助参考。-Algorithms Programming wiring problem, common language robot wiring code, using the branch and bound method to solve. Can be used as an auxiliary reference.
BBR-for-SALBP1
- BRANCH AND BOUND ASSEMBLY LINE DATA
Gomory
- Tutorial on Branch and Bound Gomory Method. Recommended for optimization.
branch-bound.ppt
- Design and Analysis Algorithm Branch Bound