Methods such as branch and bound algorithm , mixed integer programming , transportation model and separable linear programming method have been used in recently years . others are heuristic methods like genetic algorithm 近年来求解选址模型用得较多的数学优化方法有分支定界法、混合整数规划法、运输模型法、可分离线性规划法。
2 . presenting a modified branch and bound algorithm by adding the heuristic algorithm in the cluster which increasing the efficiency of eliminating node . 3 . the problem ’ s scale is decreased through using distributed parallel computing algorithm 2 .详细研究了几种主要的启发式算法,并使用启发式算法修改了分支定界算法,在保证计算精度的前提下,提高了分支节点的淘汰效率。
Based on our extensive study of many different scheduling optimizations , we can summarize the results into five scheduling rules . based on the rules and the heuristics branch and bound algorithm we can obtain an optimal scheduling algorithm for both layers of our model 根据不同生产方式优化调度研究成果得出了五个调度规则,应用这些规则与分枝定界方法分别构造出上、下层调度模型的启发式分枝定界优化算法。
The theory results and heuristics of the maximum clique problem are described and the branch and bound algorithms are discussed in detail in this paper . based on these existing algorithms , we present a new branch and bound algorithm for the maximum weight clique problem 本文首先对当前国际上最大团问题的理论研究成果及算法研究中的启发式算法进行了介绍,然后对精确算法中的分支定界法作了较为详细的讨论,最后作者在现有算法的基础上,给出了最大加权团问题的一种新的分支定界算法。
A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed , in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique 摘要构造出了一类可分离非线性0 - 1背包问题的分枝定界算法,分枝的过程是普通的0 - 1变量分枝,用简单的取整启发式法确定更好的可行解;而在每个分枝结点处用线性松弛技术确定了它的子问题的一个线性规划松弛逼近,由此得到最优值的一个下界。
Abstract : a cad tool based on a group of efficient algorithms to verify , design , and optimize power / ground networks for standard cell model is presented . nonlinear programming techniques , branch and bound algorithms and incomplete cholesky decomposition conjugate gradient method ( iccg ) are the three main parts of our work . users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed . the experimental results prove that the algorithms can run very fast with lower wiring resources consumption . as a result , the cad tool based on these algorithms is able to cope with large - scale circuits 文摘:介绍了一个基于标准单元布图模式的电源线/地线网络的辅助设计集成工具.它应用了一系列高效的算法,为用户提供了电源线/地线网络的设计、优化和验证的功能.非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分.用户可以选择使用非线性规划的方法或者几种分枝定界方法来满足他们对于精度和速度方面的不同需求.实验结果表明,文中所提供的算法可以在很快的运行速度下实现更低的布线资源占用.因此,在这些有效算法基础上实现的辅助设计工具具有处理大规模电路的能力