In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems 在第二章至第五章中,我们分别研究了四个组合优化问题的近似算法,并给出了它们的性能分析。
During the last two decades , parallel processing and parallel optimization techniques have been developed to take full advantage of computing resources from different sources , either on a mainframe computer or on network of workstations 一些典型的组合优化问题已被证明属于np完全问题,对这些问题的求解,除构造近似算法求解外,也迫切的需要提高计算能力。
This problem was first studied by n . hasan and c . l . liu in [ 5 ] , and get some useable result : this problem can be solved as a constraint bipartite vertex cover ( cbvc ) problem . hasan and liu proposed two algorithms that solves the cbvc problem 另外, kuo和fuchs还对如何修复给出了两个算法:一个是近似算法,到目前为止,该算法仍然是最高效的顶点覆盖问题的求解算法之一。
The experiments show that the performance of our method is similar to the ye - 0 . 699 algorithm , which is the best approximate algorithm in polynomial time . but our method can effectively solve the max - bisection problem with a large scale . 2 数值实验表明,该方法与ye - 0 . 699近似算法(现有的求解图的最大二等分问题的最好的多项式时间近似算法)得到的解的性能几乎没有差异
Based on tabu search , a local search technique with changeable local structure ( algorithm 2 ) is proposed for this np - hard problem , which provides an approach to control the optimizing process flexibly 基于tabu搜索设计了变邻域结构的局部搜索技术,提供了灵活控制寻优过程的途径;全多项式时间复杂性近似策略的开发,使得0一1背包问题的求解成为了n户c问题近似算法设计中最为成功的范例。