期刊
THEORETICAL COMPUTER SCIENCE
卷 265, 期 1-2, 页码 79-108出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0304-3975(01)00153-0
关键词
number partitioning; phase transition; NP-complete; heuristic algorithms; statistical mechanics; random cost problem
The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase boundary that separates the easy-to-solve from the hard-to-solve phase of the NPP as well as for the probability distributions of the optimal and sub-optimal solutions. In addition, it can be shown that solving a number partioning problem of size N to some extent corresponds to locating the minimum in an unsorted list of O(2(N)) numbers. Considering this correspondence it is not surprising that known heuristics for the partitioning problem are not significantly better than simple random search. (C) 2001 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据