Be inspired from natural plant growth, this paper proposes a bionic algorithm for solving the global optimization of nonlinear integer programming.
从大自然植物生长中得到启发，提出了一种求解非线性整数规划全局最小解的仿生算法。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
This paper proposes an efficient new algorithm by construction of a direct discrete search direction for a class of nonlinear integer programming problems.
针对一类非线性整数规划问题，通过构造直接离散搜索方向提出了一种十分有效的新算法。
The core algorithm is the generation and selection based on integer linear programming (ILP).
该系统的核心算法是基于整数规划的“生成与选择”方法。
Plant growth simulation algorithm aiming at the global optimization of integer programming is a kind of bionics random algorithm which occurs in nature.
针对整数规划全局优化问题所首次提出的模拟植物生长算法，是一种源于大自然的仿生类随机算法。
Furthermore, the integer programming method is exploited as the mathematical tool for the generation of a polynomial algorithm producing the optimal set elementary siphons.
在此基础上，以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法。
In this paper, a new branch and its bound algorithm for solving integer separable concave programming problems is proposed, and the convergence of the algorithm is proved.
提出了一种新的解整数可分离凹规划问题的分支定界算法，并证明了其收敛性。
The experimental results show the advantageous of the advantageous performance of the algorithm in integer programming.
运算结果表明，该算法对于整数规划问题有很好的效果。
Based on the research of the internal features of maintenance scheduling problem, this paper establishes its integer programming based optimization module and algorithm.
本文在研究检修计划问题的内在特点基础上，建立了基于整数规划的检修计划优化模型和算法。
The Contraction expansion algorithm was improved by greatly reducing visiting objective function, so it could solve the large scale, integer and combined constrained nonlinear programming.
将缩张算法加以改进，较大程度地减少目标函数的访问次数，既可运用到规模和难度较大的约束非线性规划问题，也可运用到整数及混合规划问题。
In order to improve the computational efficiency, a branch algorithm for general integer linear programming problems on the objective function hyperplane shifts was presented.
为了提高求解一般整数线性规划问题的效率，提出了一种基于目标函数超平面移动的分支算法。
The thesis USES 0-1 integer linear programming to construct algorithm-hardware mapping models.
论文运用运筹学中的0 - 1整数规划方法建立算法-硬件映射模型。
In this paper, the problem of multi-centres in a network is solved using implicit enumeration method for 0-1 integer programming. The algorithm is simple and can be easily realized.
本文提出用0 - 1整数规划的隐枚举法，求解网络的多中心问题，算法简单，容易实现。
Computational results indicate that LCA is a very effective algorithm to solve nonlinear programming problems and mixed-integer nonlinear programming problems.
实例计算结果表明列队竞争算法是求解非凸非线性规划问题和混合整数非线性规划问题的一种非常有效的算法。
A mixed integer programming is formulated, putting forward an optimization algorithm with an example.
文中建立了混合整数规划模型，提出了一种优化算法，并用优化算法对实例进行求解。
At the same time, a corresponding particle swarm optimization algorithm is presented to solve the optimization problem of integer resource allocation. This algorithm is easy to programming.
同时，针对整数资源分配这类组合优化问题，提出了相应的离散粒子群算法。
The Three Gorges Project; navigation co-scheduling; rolling horizon procedure; mixed-integer programming; hybrid optimization algorithm;
三峡工程； 联合通航调度；滚动时域调度；混合整数规划；混合优化算法；
The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming.
FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题，从而可用动态规划寻求最佳的出清向量；
The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming.
FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题，从而可用动态规划寻求最佳的出清向量；
应用推荐