Scarica per Windows Premium
Pubblicità
integer programming
整数规划
整數規劃
The only general solution is linear or integer programming.
唯一通行的解决方法是线性规划或者整数规划
Use of the computer for linear, non-linear and integer programming
使用计算机进行线性、非线性和整数规划
A mixed integer programming formulation for the off-line version of the problem has been proposed.
给出了问题的数学描述,并对其静态问题,构造了一个混合整数规划模型。
Convex analysis, Lagrangian relaxation, non differentiable optimization, and applications in integer programming.
凸分析、拉格朗日松弛法、不可微分函数最适化以及在整数规划上的应用。
Matrices Graphic linear inequalities The linear programming model Graphical sensitivity analysis Use of the computer for linear, non-linear and integer programming
矩阵 图示线性不等式 线性规划模型 图示敏感度分析 使用计算机进行线性、非线性和整数规划
The algorithm selected in the example is QUOTA-ALIGN which is the subject of a recent paper, "Screening synteny blocks in pairwise genome comparisions through integer programming" in BMC the paper conclusion states
在这个例子中选择的算法是配额对齐,这是最近的一篇论文的题目, "筛选通过在成对的基因组comparisions的同线性整数规划块" BMC生物信息学. 由于纸的结论国家:
Cutting planes were proposed by Ralph Gomory in the 1950s as a method for solving integer programming and mixed-integer programming problems.
切割平面法由 Ralph Gomory 在 19 世纪 50 年代提出,用于解决整数规划和混合整数规划问题。
In oder to find the optimal solution, the algorithm of the shortest path is given for linear integer programming problems.
针对解算中存在的问题,提出了最短路径法寻找整数变量线性规划问题的最优解。
In order to minimize total ordering and holding costs, a simple solution model using mixed integer programming techniques is presented to determine the optimal solution of the number of orders and timing of replenishment points, and quantity to be ordered at each replenishment.
此外,为达到极小化总订购成本及总持有成本,本模型利用混合整數规划技巧提供一个简单求解方法,可同时求得最佳订购次數、订购点及每次订购數量。
In contrast to linear programming, which can be solved efficiently in the worst case, integer programming problems are in many practical situations (those with bounded variables) NP-hard.
相對於即使在最壞情況下也能有效率地解出的線性規劃問題,整數規劃問題的最壞情況是不確定的,在某些實際情況中(有約束變量的那些)為NP困難問題。
Power generation optimal scheduling integer programming problem, and Lagrangian relaxation is a successful wide-used method problem.
标准拉格朗日(Lagrangian)松弛法是国际上应用于电力系统优化调度领域的最广泛、最成功的方法之一。
Abstract: A new algorithm W-ECOP is presented to effect incremental changes on a standard cell layout algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do.An integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength.Test of W-ECOP on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed.
文摘:提出了一种新的增量式布局方法W-ECOP来满足快速调整布局方案的要求.与以前的以单元为中心的算法不同,算法基于单元行划分来进行单元的插入和位置调整,在此过程中使对原布局方案的影响最小,并且尽可能优化线长.一组从美国工业界的测试例子表明,该算法运行速度快,调整后的布局效果好.
The GNU Linear Programming Kit (GLPK) is a software package intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems.
GNU線性規劃工具集(GNU Linear Programming Kit, GLPK)是用來求解大規模之線性規劃(LP)、混合整數規劃(MIP),跟其他相關問題的軟體包。
Nessun risultato trovato per questo significato.

Sinonimi e analogie di "integer programming" in inglese

Parola ed espressione del giorno
Immagine del giorno
honeybee: bee of genus Apis domesticated for honey
Scopri il significato
Pubblicità

Risultati: 13. Esatti: 13. Tempo di risposta: 11 ms.