.png){kind=icon}
返回
Efficient local search algorithms for the linear ordering problem
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2010.00778.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a directed graph with n vertices, m edges and costs on the edges, the linear ordering problem consists of finding a permutation pi of the vertices so that the total cost of the reverse edges is minimized. We present two local search algorithms, named LIST and TREE, for the neighborhood of the insert move, which can handle larger instances than existing methods. LIST is simpler and can search the whole neighborhood in O(m) time and TREE performs the neighborhood search in O(n+Delta log Delta) time, where Delta represents the maximum vertex degree. Computational experiments show good results for sparse instances using LIST, while TREE presents the best results independent of the density of the instance.
Keyword:
linear ordering problem
local search
balanced search tree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容