An adaptive multi-start graph partitioning algorithm for structuring cellular networks

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.17, Iss.5, 2011-10, pp. : 615-635

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes

By Walshaw C. Cross M. Everett M.G.

Journal of Parallel and Distributed Computing, Vol. 47, Iss. 2, 1997-12 ,pp. : 102-108

Academic Press

Access to resources Recommend Favorite

A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering

By Karypis G. Kumar V.

Journal of Parallel and Distributed Computing, Vol. 48, Iss. 1, 1998-01 ,pp. : 71-95

Academic Press

Access to resources Recommend Favorite

Seeking global edges for traveling salesman problem in multi-start search

By Li Weiqi

Journal of Global Optimization, Vol. 51, Iss. 3, 2011-11 ,pp. : 515-540

Springer Publishing Company

Access to resources Recommend Favorite

Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem

International Journal of Swarm Intelligence Research (IJSIR), Vol. 2, Iss. 2, 2011-04 ,pp. : 52-70

IGI Global_journal

Access to resources Recommend Favorite

Fast and Effective Classification using Parallel and Multi-start PSO

Journal of Information Technology Research (JITR), Vol. 11, Iss. 2, 2018-04 ,pp. : 13-30

IGI Global_journal

Access to resources Recommend Favorite