Description: 用vc编写的解决计算机算法中的分支限界问题，非常经典的代码，请多多指教！-vc prepared with the computer algorithm to solve the branch and bound, very classic code, a great weekend! Platform: |
Size: 498688 |
Author:徐子正 |
Hits:
Description: 我的算法作业，求一个在总花费小于1500的条件下从源结点到目的结点的最短路径，源代码Tree.cpp（C++语言编写，VC++6.0 IDE下调试通过），利用的是分支定界算法。可执行文件Tree.exe说明在ReadMeFirst请按照说明使用。-algorithm operations, for a total cost of less than 1,500 from the source node to node purpose of the shortest path, Tree.cpp source code (written in C, Visual C++ 6.0 IDE debug through), use of the branch-and-bound algorithm. Note executable file Tree.exe in ReadMeFirst follow the instructions to use. Platform: |
Size: 30720 |
Author: |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853760 |
Author:陈宝文 |
Hits:
Description: 背包问题优先队列分枝限界算法
所谓的背包问题，可以描述如下：一个小偷打劫一个保险箱，发现柜子里有N类不同大小与价值的物品，但小偷只有一个容积为M的背包来装东西，背包问题就是要找出一个小偷选择所偷物品的组合，以使偷走的物品总价值最大。这个问题的求解有很多种方法，本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as follows : a thief robbed a safe, found N closets, a different type size and value of the items, but the thieves only one volume of M backpack to hold things. knapsack problem is to identify a thief stole items chosen by the portfolio, so that stolen goods worth largest. Solving this problem is many ways, the procedures used Branch and Bound method. Platform: |
Size: 238592 |
Author:王涛 |
Hits:
Description: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes Platform: |
Size: 3072 |
Author:郎风华 |
Hits:
Description: 运筹学中的分支界定算法，c++代码，可以运行-Define a branch of operations research in algorithms, c++ Code can run Platform: |
Size: 1024 |
Author:leoee |
Hits:
Description: 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code Platform: |
Size: 22528 |
Author:lius |
Hits:
Description: 分支定界算法C语言实现源程序,标准C源代码，直接可以运行，程序有详细的说明-Branch and bound algorithm for C language source code implementation, the standard C source code can run directly, the program has a detailed description of Platform: |
Size: 146432 |
Author:wanghao |
Hits:
Description: 用来解决旅行商问题 可以直接运行 很好的代码-Used to solve the traveling salesman problem can be directly run a very good code Platform: |
Size: 2048 |
Author:罗兰 |
Hits:
Description: 分支限界法算法作业：图形变换问题解题报告和源代码。问题描述：给定2个4×4方格阵列组成的图形A和B,每个方格颜色为黑色或白色。方格阵列中有公共边的方格称为相邻方格。图形变换问题的每一步可以交换相邻方格的颜色。试设计一个队列式分支限界算法，计算最少需要多少步变换，才能将图形A变换成图形B。-Branch and bound algorithm operation: graphics transform the issue of problem-solving reports and source code. Description of the problem: given two 4 × 4 grid array of graphics components A and B, each box is black or white color. Grid arrays in the public square known as the adjacent side of the box. Transform the issue of graphics can be exchanged every step of the color of the adjacent box. Try to design a queue-type branch and bound algorithm to calculate the minimum number of steps need to transform, can be converted into graphics A graphics B. Platform: |
Size: 72704 |
Author:吴钦阳 |
Hits:
Description: 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code Platform: |
Size: 2048 |
Author:L |
Hits:
Description: 实验四：分枝限界算法设计
实现课本上旅行售货员问题的分枝限界算法(P225)，随机生成两个规模为10和20的TSP实例，比较算法运行时间。
提交源代码以及实验报告。
-Experiment 4: Design and Implementation of Branch and Bound algorithm for the traveling salesman problem textbooks Branch and Bound algorithm (P225), randomly generated two size 10 and 20 of the TSP instance, comparison algorithm running time. Report submitted to the source code and experimental. Platform: |
Size: 14336 |
Author:pactric |
Hits:
Description: 分支限界法实现旅行售货员问题，使用时间挺短的，代码可读性强-Branch and bound to achieve the traveling salesman problem, the use of time very short, readable code Platform: |
Size: 1024 |
Author:冯 |
Hits:
Search - branch and bound code