搜索资源列表
8ma
- 八数码难题，使用广度搜索，体现分支限界法的思想-Eight puzzle, use the search scope, reflecting the branch and bound ideas ×××××
fzxj
- 一般解空间的队列式分支限界法 试设计一个用队列式分支限界法搜索一般解空间的函数。该函数的参数包括结点可行性 判定函数和上界函数等必要的函数，并将此函数用于解布线问题。 -Queue-type general solution space try to design a branch and bound branch and bound with a queue-type search function of the general solution space. The funct
the-shortest-path-problem
- 算法设计与分析，分支限界法解单元最短路径问题。-Algorithm design and analysis, branch confines method ifm unit the shortest path problem.
shortest-path
- 寻找单源最短路径问题的优先队列式分支限界法-Single-source shortest path problem priority queue type branch and bound
01-knapsack-problem--
- 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
traveler
- 旅行商问题的分支限界法 经典算法的JAVA实现-Traveling Salesman Problem classical branch and bound algorithm to achieve JAVA
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
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
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
five
- 利用分支限界法求解旅行商问题 用C++实现用分支界限法解决旅行商问题，-http://www.pudn.com/login.asp
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
packing-problem
- 分别用分支搜索法和分支限界法解决装载问题，用C++实践-Search method and the branch with branch about solving problems of loading
KnapSack
- 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
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.