{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:04:42Z","timestamp":1775912682349,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5350,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0004-3702(98)00086-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:38Z","timestamp":1027640258000},"page":"181-203","source":"Crossref","is-referenced-by-count":157,"title":["A complete anytime algorithm for number partitioning"],"prefix":"10.1016","volume":"106","author":[{"given":"Richard E.","family":"Korf","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(98)00086-1_BIB1","series-title":"Proceedings AAAI-94","first-page":"1341","article-title":"Exploiting algebraic structure in parallel state space search","author":"Bright","year":"1994"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB2","series-title":"Proceedings IJCAI-89","first-page":"979","article-title":"Solving time-dependent planning problems","author":"Boddy","year":"1989"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB3","series-title":"Proceedings IJCAI-91","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB5","article-title":"The number partition phase transition","author":"Gent","year":"1995"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB6","series-title":"Proceedings IJCAI-97","first-page":"1396","article-title":"From approximate to optimal solutions: constructing pruning and propagation rules","author":"Gent","year":"1997"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB7","series-title":"Proceedings IJCAI-95","first-page":"607","article-title":"Limited discrepancy search","author":"Harvey","year":"1995"},{"issue":"2","key":"10.1016\/S0004-3702(98)00086-1_BIB8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the Knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0004-3702(98)00086-1_BIB9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(87)90033-6","article-title":"Phase transitions in artificial intelligence systems","volume":"33","author":"Huberman","year":"1987","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(98)00086-1_BIB10","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: an experimental evaluation. Part II: graph coloring and number partitioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(98)00086-1_BIB11","series-title":"Proceedings 4th International Conference on Genetic Algorithms","first-page":"442","article-title":"Solving partitioning problems with genetic algorithms","author":"Jones","year":"1991"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB12","article-title":"The differencing method of set partitioning","author":"Karmarkar","year":"1982"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB13","doi-asserted-by":"crossref","first-page":"626","DOI":"10.2307\/3214002","article-title":"Probabilistic analysis of optimum partitions","volume":"23","author":"Karmarkar","year":"1986","journal-title":"J. Appl. Probab."},{"key":"10.1016\/S0004-3702(98)00086-1_BIB14","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB15","series-title":"Proceedings IJCAI-95","first-page":"266","article-title":"From approximate to optimal solutions: a case study of number partitioning","author":"Korf","year":"1995"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB16","series-title":"Proceedings AAAI-96","first-page":"286","article-title":"Improved limited discrepancy search","author":"Korf","year":"1996"},{"key":"10.1016\/S0004-3702(98)00086-1_BIB17","series-title":"Proceedings AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"issue":"2","key":"10.1016\/S0004-3702(98)00086-1_BIB18","doi-asserted-by":"crossref","DOI":"10.1007\/BF02192530","article-title":"Easily searched encodings for number partitioning","volume":"89","author":"Ruml","year":"1996","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"10.1016\/S0004-3702(98)00086-1_BIB19","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1137\/0210033","article-title":"A T = O(2n2), S = O(2n4) algorithm for certain NP-complete problems","volume":"10","author":"Schroeppel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0004-3702(98)00086-1_BIB20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/moor.21.1.85","article-title":"The differencing algorithm LDM for partitioning: a proof of a conjecture of Karmarkar and Karp","volume":"21","author":"Yakir","year":"1996","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0004-3702(98)00086-1_BIB21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0004-3702(95)00054-2","article-title":"A study of complexity transitions on the asymmetric traveling salesman problem","volume":"81","author":"Zhang","year":"1996","journal-title":"Artificial Intelligence"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000861?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000861?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T21:58:05Z","timestamp":1555538285000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370298000861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0004370298000861"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00086-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}