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: 物流分析工具包。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: 整数规划分支定界算法matlab通用源程序
各参数的意义同matlab优化工具箱的线性规划函数linprog
调用前，输入参数要化成matlab的标准形式-Integer programming branch and bound algorithm matlab source general meaning of each parameter with the matlab optimization toolbox of linear programming linprog function call before the input parameters to the standard form into matlab Platform: |
Size: 1024 |
Author:周虎川 |
Hits:
Description: 这是非线性整数规划模型求解分支定界迭代算法-This is a non-linear integer programming model to solve iterative algorithm branch and bound Platform: |
Size: 5120 |
Author:王丹 |
Hits:
Description: 在模式识别应用中，用分支定界法(branch-and-board method)进行特征的选择。该程序在matlab环境下实现了该算法，以从六个特征中选择两个最佳特征为例-In pattern recognition applications, using branch and bound method (branch-and-board method) to carry out the characteristics of choice. The program in the matlab environment to achieve the algorithm to select from the following six characteristics of the best features of the two as an example Platform: |
Size: 6144 |
Author:陈坚 |
Hits:
Description: 非线性整数规划算法，求解非线性整数规划活混合规划问题，常用的算法是分枝定界算法。基于该算法编成的现成函数bnb20()-Nonlinear integer programming algorithm for solving nonlinear mixed integer programming live planning problem, commonly used algorithms are branch-and-bound algorithm. Based on the algorithm into off-the-shelf function bnb20 () Platform: |
Size: 138240 |
Author:wangjunxia |
Hits:
Description: 分支定界，找出最优解，此编程是以六个特征为例进行编程的。-Branch and bound, to find the optimal solution, this program is based on six characteristics of the program as an example. Platform: |
Size: 3072 |
Author:陈西 |
Hits:
Description: 最优决策——用几个matlab编程的实例阐述分支定界法的思想是：首先确定目标值的上下界-Optimal decision-making- matlab programming with some examples of the branch and bound method is the idea: First, determine the target of the upper and lower bounds Platform: |
Size: 6144 |
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:
Description: 在实际应用着经常需要求解非线性整数规划或混合规划问题，该领域中的一种常用的算法是分支定界(branch and bound)算法，但是matlab工具箱中没有相关的函数。荷兰Groningen大学的Koert Kuipers编写的的BNB20工具箱可以用来求解一般非线性整数规划问题-In practice, frequent need to solve nonlinear integer programming or mixed programming problem, the area a popular algorithm is the branch and bound (branch and bound) algorithm, but the matlab toolbox functions are not related. Netherlands, Groningen University, prepared the BNB20 Koert Kuipers toolbox can be used to solve general nonlinear integer programming problem Platform: |
Size: 5120 |
Author:leilei |
Hits:
Description: 分支定界法，可以求解线性规划问题，用matlab解决，感觉不错(Branch and bound method can be used to solve linear programming problems) Platform: |
Size: 1024 |
Author:longzhe
|
Hits:
Search - branch and bound matlab