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: 4853791 |
Author:陈宝文 |
Hits:
Description: 这是一个好的建模学习资料,赶快下载吧,
数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、
插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、
图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、
最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、
网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, download it quickly, mathematical modeling algorithm 10 (includes : Monte Carlo algorithm, data fitting, parameter estimation, interpolation of data-processing algorithms, linear programming, integer programming, diversity planning, Quadratic Programming category of zoning, graph-theoretical algorithms, dynamic programming, retroactive search, the partition algorithm, branch-and-bound algorithm computer, most optimization theory of the three non-classical algorithm : simulated annealing, neural networks, genetic algorithms, mesh algorithms and exhaustive, some consecutive discrete method, numerical analysis algorithms, image processing algorithm) Platform: |
Size: 5929399 |
Author:zhxj |
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: 这是一个好的建模学习资料,赶快下载吧,
数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、
插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、
图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、
最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、
网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, download it quickly, mathematical modeling algorithm 10 (includes : Monte Carlo algorithm, data fitting, parameter estimation, interpolation of data-processing algorithms, linear programming, integer programming, diversity planning, Quadratic Programming category of zoning, graph-theoretical algorithms, dynamic programming, retroactive search, the partition algorithm, branch-and-bound algorithm computer, most optimization theory of the three non-classical algorithm : simulated annealing, neural networks, genetic algorithms, mesh algorithms and exhaustive, some consecutive discrete method, numerical analysis algorithms, image processing algorithm) Platform: |
Size: 5928960 |
Author:zhxj |
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 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: 运用分支定界法求解混合整数线性规划，可用于求解电力系统机组组合问题- solving mixed integer linear programming branch and bound method ,and the program can solve unit commitment problem Platform: |
Size: 2048 |
Author:苏济归 |
Hits:
Description: 实验目的：用Matlab实现分支定界法求解整数线性规划问题。
实验内容：
用分支定界法求下面的线性整数规划问题的最优解：
-Experiment Objective: Matlab to achieve branch and bound method for solving integer linear programming problem.
Experiment content:
With the branch and bound method seeking the following linear integer programming problem of the optimal solution:
Platform: |
Size: 14336 |
Author:wanggen |
Hits:
Description: matlab最优化程序包括
无约束一维极值问题
进退法 黄金分割法 斐波那契法 牛顿法基本牛顿法 全局牛顿法 割线法 抛物线法 三次插值法 可接受搜索法
Goidstein法 Wolfe.Powell法
单纯形搜索法 Powell法 最速下降法
共轭梯度法 牛顿法 修正牛顿法
拟牛顿法 信赖域法 显式最速下降法，
Rosen梯度投影法
罚函数法 外点罚函数法 內点罚函数法
混合罚函数法 乘子法
G－N法 修正G－N法 L－M法
线性规划 单纯形法 修正单纯形法
大M法 变量有界单纯形法
整数规划 割平面法 分支定界法
0-1规划 二次规划
拉格朗曰法 起作用集算法
路径跟踪法
粒子群优化算法 基本粒子群算法 带压缩因子的粒子群算法 权重改进的粒子群算法
线性递减权重法 自适应权重法
随机权重法 变学习因子的粒子群算法
同步变化的学习因子
异步变化的学习因子 二阶粒子群算法
二阶振荡粒子群算法
-matlab optimization process includes
Non-binding one-dimensional extremum problems
Advance and retreat method Golden Section Fibonacci method of basic Newton s method Newton s method Newton s Law of the global secant method parabola method acceptable to the three interpolation search method
Goidstein France Wolfe.Powell France
Simplex search method Powell steepest descent method
Conjugate gradient method Newton s method Newton s method to amend
Quasi-Newton Method trust region method explicitly steepest descent method,
Rosen gradient projection method
Penalty function method outside the penalty function method within the penalty function method
Mixed penalty function multiplier method
G-N was amended in G-N method L-M method
Of linear programming simplex method, revised simplex method
Big M method variables bounded simplex method,
Cutting Plane Method integer programming branch and bound method
0-1 programming quadratic programming
Platform: |
Size: 38912 |
Author:百位过 |
Hits:
Description: 线性规划问题(单纯形法、完整单纯形法与修正单纯形法)与整数规划问题(割平面法、分支定界法与0-1规划)的matlab源程序-matlab source programs of linear programming including simple method, complete simple method and modified simple method and integer programming including dividing plane method, branch and bound method and 0-1 programming method. Platform: |
Size: 5120 |
Author:张干清 |
Hits:
Description: 用带线性松驰的分支定界算法求解混合整数线性规划问题的软件系统源代码-MINTO is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations. Platform: |
Size: 222208 |
Author:王鹏 |
Hits:
Description: 最优化问题中分枝定界法求解整数线性规划问题-Optimization of branch and bound method for solving integer linear programming problem Platform: |
Size: 1024 |
Author:夜海星 |
Hits:
Description: 分枝定界法程序，解混合整数线性规划《详解MATLAB在最优化计算中的应用》中的分枝定界法程序，稍作了修改-Branch and bound method procedures, the solution mixed integer linear programming, " Detailed MATLAB optimization calculation in the application" in the branch and bound procedure, slightly modified Platform: |
Size: 2048 |
Author:仪大勇 |
Hits:
Description: 附件是一些参考文章，选一些能读懂的来学习。也可以自己上图书馆中国期刊全文数据库再下载相关的文献来看。准备下学期第三周写出开题报告。
要准备把其中doc文件的模型编程求解（可视化），需求数据当然可随意改变输入
-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: 2048 |
Author:邝 |
Hits:
Description: 分支界定实现源程序,本程序用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. Platform: |
Size: 3072 |
Author:donkey2 |
Hits:
Description: 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This is a good model to study the information, download it quickly, mathematical modeling algorithm 10 (includes: Monte Carlo algorithm, data fitting, parameter estimation, interpolation of data processing algorithms, linear programming, integer programming, diversity planning, Quadratic Programming Programming category of zoning, graph algorithms, dynamic programming, backtracking search, divide and conquer algorithm, branch and bound algorithm computer, optimization theory of the three non-classical algorithm: simulated annealing, neural networks, genetic algorithms, network lattice algorithms and exhaustive, some consecutive discrete method, numerical analysis algorithms, image processing algorithm) Platform: |
Size: 4994048 |
Author:高雄飞 |
Hits:
Description: This function solves the mixed integer linear programming problems. It
uses the linprog.m function that comes with the optimization toolbox
of MATLAB. It employs the branch and bound algorithm. It uses depth
first search. Platform: |
Size: 1024 |
Author:zeinab |
Hits:
Description: 最优化的里整数规划里0—1规划算法和分枝定界法，matlab编写，代码规范，方便初学者学习！-the program is with the binary integer linear programming and integer linear programming use branch and bound method! Platform: |
Size: 2048 |
Author:David |
Hits:
Search - branch and bound linear programming integer