The p-center problem consists of choosing a subset of vertices in an undirected graph as facilities in order to minimize......

Traveling Salesman Problem (TSP) is one of the most widely studied real world problems of finding the shortest (minimum ......

为提高基于迭代改进的传统电路划分算法的划分质量，提出了一种基于贪心随机自适应搜索过程（greedy randomized adaptive search proc......

首先由改进后的GRASP算法构造初始划分，并作局部搜索产生一组优秀解；再由path—relinking算法在优秀解间建立路径，搜索路径上的改进解......