.png){kind=icon}
返回
A complete anytime algorithm for number partitioning
.png){kind=icon}
PRE
AI
DOI：10.1016/S0004-3702(98)00086-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a set of numbers, the two-way number partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The problem is NP-complete. Based on a polynomial-time heuristic due to Karmarkar and Karp, we present a new algorithm, called Complete Karmarkar-Karp (CKK), that optimally solves the general number-partitioning problem, and significantly outperforms the best previously-known algorithms for large problem instances. For numbers with twelve significant digits or less, CKK can optimally solve two-way partitioning problems of arbitrary size in practice. For numbers with greater precision, CKK first returns the Karmarkar-Karp solution, then continues to find better solutions as time allows. Over seven orders of magnitude improvement in solution quality is obtained in less than an hour of running time. Rather than building a single solution one element at a time, or modifying a complete solution, CKK constructs subsolutions, and combines them together in all possible ways. This approach may be effective for other NP-hard problems as well. (C) 1998 Elsevier Science B.V. All rights reserved.
Keyword:
number partitioning
anytime algorithm
NP-complete
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
Effects of Oyster Mushroom Pleurotus pulmonarius on Preparasitic Larvae of Bovine Trichostrongyles
OAAI
OAAI分享收藏Cut-off values of obesity indices to predict coronary heart disease incidence by time-dependent receiver operating characteristic curve analysis in 10-year follow-up in study of Yazd healthy heart cohort叶尔羌健康心脏队列研究中，通过时间依赖性受试者工作特征曲线分析预测冠状动脉疾病发病率的肥胖指数截断值，在10年随访期间。.png)
IF0
PREAI
分享收藏 没有更多内容
没有更多内容