Traveling salesman problems with PageRank distance on complex networks reveal community structure

DOI10.1016/J.PHYSA.2016.07.050zbMath1400.91473OpenAlexW2506034436MaRDI QIDQ1620011

Zhongzhou Jiang, Shuai Wang, Jing Liu

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2016.07.050

zbMATH Keywords

traveling salesman problemsPageRankcommunity detection problems

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Network design and communication in computer systems (68M10) Combinatorial optimization (90C27)

Related Items (1)

On the spectrum of two-layer approach and multiplex PageRank

Uses Software

• LKH

Cites Work

• Unnamed Item
• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• Adequate is better: particle swarm optimization with limited-information
• Community detection in hypernetwork via density-ordered tree partition
• Match twice and stitch: a new TSP tour construction heuristic.
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An improved multi-objective evolutionary algorithm for simultaneously detecting separated and overlapping communities
• Genetic operators for combinatorial optimization in TSP and microarray gene ordering
• Enhancing community detection using a network weighting strategy
• From the Cover: The structure of scientific collaboration networks
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks
• Multilevel local search algorithms for modularity clustering
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Traveling salesman problems with PageRank distance on complex networks reveal community structure