搜索资源列表
The-TSP-problem
- The TSP problem - 旅行商问题，回溯，分支界限法解决-The TSP problem- traveling salesman problem, backtracking, branch-and-bound method to solve
intprog
- 通过分支定界法计算线性规划、整数规划,效果较好。-To calculate integer programming, branch and bound method is better.
ChTSP
- 分支限界算法求解TSP问题，还不错，可以下载-Branch-and-bound algorithm for TSP, well, you can download to see
tsp_bb
- 旅行商问题的分支定界解法，含有详细的注释和说明，希望对你有用。-Branch and bound
Knapsack
- 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorith
buxianwenti
- 实验要求：请在下图所给出电路板中，按布线要求，利用队列式或优先队列分支限界法实现从a到b的布线工作 -Experimental requirements: On the graph below given circuit board, wiring requirements, queue or priority queue branch and bound method to achieve the wiring from a to b
mochila_BB
- Branch and Bound program for the backpack problem
Eight-puzzle
- 八数码难题-两种不同的分支限界法解决 input.txt中为起始的状态，output.txt\output2.txt为两种不同解法的输出-Eight digital problem- two different branch and bound method for solving input.txt initial state, output.txt \ output2.txt solution for the two different output
jsp实现flowshop
- 网上花店实现很多Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including flowshop and make the two categories, containing the test data us
6d2
- 王晓东《算法设计与分析》第六章第二节分支限界法求单源最短路劲问题源代码-Xiaodong " algorithm design and analysis" section 6.2 branch and bound method for single-source shortest path problem Energizer source code
6d3-1
- 王晓东《算法设计与分析》第六章第三节装载问题队列式分支限界法求解-Xiaodong " algorithm design and analysis," Chapter III loading problems queue-style branch and bound method to solve
6d3-2
- 王晓东《算法设计与分析》第三节装载问题优先队列式分支限界法求解-Xiaodong " algorithm design and analysis" problem loading priority queue type III branch and bound method to solve
6d4
- 王晓东《算法设计与分析》第六章第四节布线问题队列式分支限界法求解-Xiaodong " algorithm design and analysis," Chapter IV wiring problems queue-style branch and bound method to solve
6d5
- 王晓东《算法设计与分析》第六章第五节0-1背包问题分支限界法求解-Xiaodong " algorithm design and analysis," Chapter V 0-1 knapsack problem branch and bound method to solve
mixed-integer-linear
- 分支界定实现源程序,本程序用C语言实现，故依据C语言的语法，数字0表示甲城市，数字49表示乙城市.-This is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations.
xxx
- MATLAB分支定界法的实现，附带代码和例题-MATLAB implementation of branch and bound method, with code and examples
fenzhijiexifa
- 队列式分支界限法解决的最优装载问题，STL-Queue-type branch and bound method to solve the problem of the optimal loading
nHuangHou
- 队列式分支界限法实现的n皇后问题，采用文件的方式输入输出-Queue-type branch and bound method to achieve the n-queens problem, using the method of file input and output
branch-and-bound
- 本程序用C语言实现，运用弗洛伊德算法求解最短路径问题-This procedure using C language, using Floyd algorithm for the shortest path problem
knapsack
- A branch and bound algorithm for the 0-1 knapsack problem.