搜索资源列表
lp_solve_5.5.0.12_MATLAB_exe
- lp_solve_5.5.0.12_MATLAB_exe，混合整数优化问题的求解-lp_solve_5.5.0.12_MATLAB_exe, mixed-integer optimization problem solving
lp_solve_5.5.0.13_MATLAB_source.tar
- lp_solve_5.5.0.13_MATLAB_source.tar，混合整数优化问题的求解-lp_solve_5.5.0.13_MATLAB_source.tar, mixed-integer optimization problem solving
lp_solve_5.5.0.12_MATLAB_source.tar
- lp_solve_5.5.0.12_MATLAB_source.tar版本，用于混合整数优化问题的求解-lp_solve_5.5.0.12_MATLAB_source.tar version for mixed integer optimization problems to solve
fraction
- /* 描述： 1.自定义分数类fraction，使用该类可以完成分数的输入、分数的加、减、乘、除二目运算和一目减运算、分数的约分操作、分数的倒数运算、对两个分数进行六种比较运算、以及对分数的输出等操作。 2.尽量用运算符重载函数。如，可重载+、-、*、/、>、>=、<、<=、==、!=，以实现分数的各种运算。并且实现分数与整数的混合运算。 3.尽可能考虑程序性能。-/* Descr iption: 1. Custom scores of class
MILP
- Mixed integer linear programming source code
minto
- 用带线性松驰的分支定界算法求解混合整数线性规划问题的软件系统源代码-MINTO is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations.
Mintegera
- 通常matlab不能进行整数规划，现一一款混合整数的线形规划matlab m文件 -Usually matlab integer programming, now a mixed integer linear programming matlab m file
lagrangian-relax
- 拉格朗日插值求解最优，适用于混合整数规划问题模型-Lagrange interpolation for solving optimal, suitable for mixed-integer programming problem model
Bonmin-1.6.0
- BONMIN: Basic Open-source Nonlinear Mixed Integer programming(model types: LP, RMIP, MIP, DNLP, NLP, RMINLP, MINLP, QCP, RMIQCP, MIQCP)
mi_test_probs_src
- Mixed integer nonlinear programming (MINLP) problems are an important class of optimization problems with many real world applications.
blend
- cplex混合整数规划matlab实现 cplex混合整数规划matlab cplex混合整数规划matlab-cplex mixed integer programming matlab cplex mixed integer programming matlab cplex mixed integer programming mixed integer programming matlab matlab cplex
Branch-and-bound-method
- MALAB写的，分支定界法求解纯整数或混合的整数规划问题。-Written MALAB, branch and bound method to solve pure integer or mixed integer programming problem.
gurobi562
- Gurobi Mex is a free MATLAB interface for Gurobi 2, 3, and 4 written by Wotao Yin with contributions by Jon Dattorro, Imre Polik, and Tomáš Strnad. It calls Gurobi to solve linear/quadratic/mixed-integer optimization problems.-Gurobi Mex is a fre
DIRECT.tar
- 我们考虑的问题最小化一个连续可微的函数的几个变量服从 简单数据绑定约束限制的一些变量的整数值。我们假设 目标函数的一阶衍生品可以显式计算和近似。 这类混合整数非线性优化问题出现在许多工业和频繁 科学应用,这促使derivative-free方法的研究越来越感兴趣 他们的解决方案。连续变量是由linesearch策略而解决 离散的我们雇佣当地的一个类型的搜索方法。我们提出了不同的算法 以当前迭代的方式更新和满意的平稳性条件 序列的极限点。-We consider the probl
IP
- 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.
scop
- 用于配电网的重构的混合整数二阶锥规划，利用yamilp工具箱，同时利用了cplex/mosek等求解器求解，配电网示例网架结构较简单。(The mixed integer two order cone programming is used in the distribution network reconfiguration, and the yamilp toolbox is used. At the same time, the cplex/mosek solver is used to
pro_matlab_bb.m
- 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。(Branch and bound (branch and bound) is one of the most commonly used algorithms for integer programming problems. This method can not only solv
PuLP-1.6.8
- pulp，用于线性规划和混合整型规划的Python包，非常好用，与普通的建模软件lingo一样简便易用，功能强大(Pulp, for linear programming and mixed integer programming Python package, very easy to use, and ordinary lingo modeling software is easy to use, powerful)
MILP_train_4
- 利用混合整数规划方法求解，目标是列车运行优化与控制(Solving the problem by mixed integer programming)
monituihuo
- 提出了一种混合模拟退火算法, 以模拟退火法作为随机搜索引擎,利用逻辑编程和线性规划来检验和处理搜索结果。这种算法既可以发挥随机搜索法的快速寻找可行解的优势, 又可以充分考虑特定问题内在的逻辑和数学关系, 使之可以在较短的时间内得到一较优解实例计算结果表明, 同传统的混合整数线性规划方法相比这种算法可以快速地给出优化解, 月优化值与全局最优依差别不大, 可以更好地解决原油实际调度问题(A hybrid simulated annealing algorithm is proposed, which