Description: 算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC++ prepared Platform: |
Size: 3072 |
Author:ddd |
Hits:
Description: 算法设计中的分支限界法中的批处理作业调度问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC++ prepared Platform: |
Size: 10240 |
Author:ddd |
Hits:
Description: 图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run Platform: |
Size: 2048 |
Author:谢继晖 |
Hits:
Description: 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable. Platform: |
Size: 3072 |
Author:唐海浪 |
Hits:
Description: 旅行商问题的算法，采用分枝限界。网上都只有算法描述，没有实现，这里给出了完整实现，并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm description, failed to materialize here is the realization of complete, and packaged as a category. Platform: |
Size: 2048 |
Author:赵刚 |
Hits:
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: 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc Platform: |
Size: 163840 |
Author:yy |
Hits:
Description: 货郎担分枝限界图形演示
问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem description : A salesman to a number of cities to sell commodities, the known distance between cities (or travel). He selected a departure from the resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. Platform: |
Size: 4096 |
Author:林周 |
Hits:
Description: 采用分枝限界法解决0/1背包问题!
本人上机实习作业,通过老师验收,合格!
针对部分上机实习的同学可以来下~-used Branch and Bound France 0/1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the machine for students to the next ~ Platform: |
Size: 1024 |
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个不同的供应商处购得。设w(i,j)是从供应商j处购得的部件i的重量,C(i,j)是相应的价格。
设计一个优先列式分支限界法，给出总价格不超过c的最小重量机器设计。-minimum weight machines based design of a machine n components, each component can be 000 m from different vendors purchased. Let w (i, j) is from the supplier j purchased components of the weight i, C (i, j) is the corresponding price. Design a priority out-branch and bound method, the total price is less than the minimum weight c machine design. Platform: |
Size: 2048 |
Author:卢起雪 |
Hits:
Description: 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。-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 a hybrid of branch and bound and cutting plane methods. Platform: |
Size: 1384448 |
Author:abrahamlau |
Hits:
Search - branch-and-bound