当前位置：
首页 资源下载
搜索资源 - branch and bound for integer programming
搜索资源列表
-
3下载：
matlab解用分支定界法解整数规划的程序。请大家参考-solutions using Matlab branch and bound method for integer programming procedures. Please refer
-
-
1下载：
物流分析工具包。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: Sho
-
-
0下载：
分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。
,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
-
-
1下载：
运用分支定界法求解混合整数线性规划，可用于求解电力系统机组组合问题- solving mixed integer linear programming branch and bound method ,and the program can solve unit commitment problem
-
-
0下载：
分枝定界法求解整数规划的MATLAB实现-Branch and Bound Method for Solving Integer Programming MATLAB to achieve
-
-
0下载：
问题描述：按照国际象棋的规则，车可以攻击与之处在同一行或同一列上的棋子。指南车是有方向的车。横向指南车可以攻击与之处在同一行上的棋子。纵向指南车可以攻击与之处在同一列上的棋子。指南车问题要求在m×n格的棋盘上放置指南车，并确定各指南车的攻击方向，使棋盘上不受指南车攻击的方格数最多。
编程任务：对于给定的m×n格的棋盘和2 个整数x 和y。整数x 表示棋盘上有x个规定方格应放置指南车，但攻击方向未定。整数y表示除了已规定放置位置的x个指南车外，还要在棋盘上放置y个指南车，其位置和攻击方向
-
-
0下载：
非线性整数规划算法，求解非线性整数规划活混合规划问题，常用的算法是分枝定界算法。基于该算法编成的现成函数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
-
-
0下载：
分支定界算法的GUI版
用来解整数规划问题
相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
-
-
0下载：
filldisk is an utility to optimize filling a media (cd/dvd/others with big files while wasting the minimum amount of space on it.
It is an integer binary programming application using a customized branch and bound algorithm which focuses on yes/no
-
-
0下载：
实验目的：用Matlab实现分支定界法求解整数线性规划问题。
实验内容：
用分支定界法求下面的线性整数规划问题的最优解：
-Experiment Objective: Matlab to achieve branch and bound method for solving integer linear programming problem.
Experiment content:
With the branch and bound method seek
-
-
0下载：
最优化问题中分枝定界法求解整数线性规划问题-Optimization of branch and bound method for solving integer linear programming problem
-
-
0下载：
matlab利用分支定界法求解整数规划的m函数文件，有详细的输入说明-matlab using the branch and bound method for solving integer programming m-function file, a detailed descr iption of the input
-
-
2下载：
分支定界法、割平面法、隐式枚举法的整数规划matlab源代码-The branch and bound method for, cut plane method, the method of implicit enumeration methods of integer programming matlab source code
-
-
0下载：
YALMIP，用于求解整数规划，主要思想为分支界定，效率和功能都比较好-YALMIP, for solving integer programming, the main idea of the branch and bound, efficiency and function are better
-
-
1下载：
运用分枝定界法求解混合整数规划程序
各输入参数的含义：
min f*x
A*x<=b
Aeq*x=beq
iter_num_max:迭代次数的上限
lb:各变量的下限
ub:各变量的上限
x0:初值
ID:0、1变量，ID(k)=1,表示第k个变量为整数变量，ID(k)=0，表示第k个变量为非整数变量
ftemp_up:初始上界,无法找到初始上界，默认为无穷大
IP：初始可行解，无法找到初始可行解，默认为空
各输出参
-
-
0下载：
整数规划：用割平面法求解整数规划
用分支定界法求解整数规划
用枚举法（包括穷举法和隐枚举法）求解0－1规划
-Integer programming: cutting plane method for solving integer programming with branch and bound method for solving integer programming Solving 0-1 planning enumeration method (exhaustive me
-
-
0下载：
分支定界算法的GUI版用来解整数规划问题相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
-
-
0下载：
整数规划，0-1整数规划，分支定界法求最优解-0-1 integer programming integer programming, branch and bound method for the optimal solution
-
-
0下载：
分支定界算法的GUI版用来解整数规划问题相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
-
-
0下载：
运用分枝定界法求解混合整数规划的matlab程序- Use the branch and bound method for solving mixed integer programming procedures -Use the branch and bound method for solving mixed integer programming procedures
-
