首页 | 本学科首页   官方微博 | 高级检索  
     


Variable Neighborhood Search for extremal vertices : The AutoGraphiX-III system
Affiliation:1. GERAD & HEC Montréal, 3000, chemin de la Côte-Sainte-Catherine, Montréal (Québec) Canada, H3T 2A7, Canada;2. RWTH Aachen University, Chair of Operations Research, Kackertstraße 7, D-52072 Aachen, Germany
Abstract:More than fifteen years after the beginning of the development of AutoGraphiX (AGX), a third version of the software is made available. Since the program was rewritten from scratch, it was the opportunity to look forward and consider new avenues. From the user׳s point of view, the interface is completely changed, which allows the display of multiple information which was not possible in the previous versions. However, one of the main improvements is that it is designed to help researchers in the field of complex networks. In these days when increasing research is applied to complex networks (such as social networks), the use of quantities related to vertices, indicating the centrality (the importance of an actor in the network measured as a topological indicator) naturally leads researchers toward the mathematical study of these quantities. This new paradigm implies a complete change in the optimization algorithm that now natively handles multi objective optimization problems involving vertex-related measures.
Keywords:Variable neighbourhood search  Graph theory  Extremal graphs  AutoGraphiX
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号