搜索资源列表
TSP
- TSP分支限界法求最短路径，可读取代价矩阵的txt。-Use TSP branch and bound Method to find the shortest path. Cost matrix can be read from txt.
knapsack(five)
- 实现0-1背包问题的优先队列分支限界算法 FIFO 分支限界算法 递归法 回溯法 动态规划算法-0-1 knapsack problem to achieve the priority queue FIFO branch and bound algorithms branch and bound backtracking algorithm recursion dynamic programming algorithm
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
fenzhixianjiefa
- 分支限界法常以广度优先或以最小耗费（最大效益）优先的方式搜索问题的解空间树。-Branch and bound often breadth-first or least-cost (most effective) way of priority the solution space tree search problems.
fenzhixianjiefa
- 文章详细讲解分支限界的基本思想，单元最短路径问题，含有源代码和截图-Article explain in detail the basic idea of branch and bound, the shortest path problem unit, containing the source code and screenshots
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
TravelingSalesman
- 旅行商问题的一种解法---分支限界法。输入每个城市之间的消耗，有程序给出最优解---- A Method for Solving TSP branch and bound method. Between the consumption of inputs in each city, the program gives the optimal solution with
cPP
- 数据结构算法与应用，在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。-Data structures algorithms and applications, in a brief review of basic C++ programming con
2-22
- 分支定界法实现旅行商问题，分支定界法是算法里非常重要的一个方法-Branch and bound method to achieve the traveling salesman problem, branch and bound algorithm is a very important way in
bb
- 货郎担分枝限界图形演示 很不错的源码哦-Branch and Bound graphical presentation traveling salesman
IntProgFZ1
- matlab利用分支定界法求解整数规划的m函数文件，有详细的输入说明-matlab using the branch and bound method for solving integer programming m-function file, a detailed descr iption of the input
suanfa2
- 分支限界法、分治法、动态规划法常见代码，素数环问题、背包问题、抄写书稿问题。-Branch and bound method, divide and conquer, dynamic programming method common code, prime ring problem, knapsack problem, the problem copying the manuscr ipt.
01packet
- 使用分支限界法解决01背包问题，c++代码实现，能够正确运行-Using the branch and bound method to solve the 01 knapsack problem, c++ code to run properly
suanfashiyan
- 十个算法小程序：二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划（多段图、0-1背包、资源分配问题）、回溯和分支限界法（子集和数问题）-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, the optimal loading, dynamic pro
pichuli5.3
- 分支限界法解决批处理作业调度问题 算法分析与设计-Branch and bound method to solve the problem of batch job scheduling
Projects
- 分支限界法贪心算法和动态规划解决装载问题 算法分析与设计-Greedy algorithm branch and bound method and dynamic programming to solve loading problems
KnapSack
- 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
ESR-1_0
- Implementation of branch and bound algorithm
DPAlgo
- 用分支定界算法求解一个点到点最短路径问题，并有最大开销限制。所用的数据矩阵很大，可以用来研究分支限界和动态规划。-Branch and bound algorithm for a point to point shortest path problem, and the maximum spending limits. The data matrix can be used to study branch and bound and dynamic programming.
ip
- 分支定界法、割平面法、隐式枚举法的整数规划matlab源代码-The branch and bound method for, cut plane method, the method of implicit enumeration methods of integer programming matlab source code