{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T05:06:15Z","timestamp":1733375175026,"version":"3.30.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence in Engineering"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1016\/s0954-1810(99)00004-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:46:00Z","timestamp":1027608360000},"page":"287-300","source":"Crossref","is-referenced-by-count":5,"title":["Combined analytical and empirical learning framework for branch and bound algorithms: the knapsack problem"],"prefix":"10.1016","volume":"13","author":[{"given":"M.J.","family":"Realff","sequence":"first","affiliation":[]},{"given":"P.H.","family":"Kvam","sequence":"additional","affiliation":[]},{"given":"W.E.","family":"Taylor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1979","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","key":"10.1016\/S0954-1810(99)00004-7_BIB1"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB2","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1126\/science.251.4995.754","article-title":"Exact solution of large asymmetric travelling salesman problems","volume":"251","author":"Miller","year":"1991","journal-title":"Science"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0098-1354(93)80016-G","article-title":"General algorithm for short-term scheduling of batch operations. Part II\u2014computational issues","volume":"17","author":"Shah","year":"1993","journal-title":"Computers and Chemical Engineering"},{"issue":"3","key":"10.1016\/S0954-1810(99)00004-7_BIB4","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","article-title":"Disjunctive programming and a hierarchy of relaxations for discrete optimization problems","volume":"6","author":"Balas","year":"1985","journal-title":"SIAM Journal of Algebraic Discrete Methods"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB5","unstructured":"Pekny JF, Reklaitis GV. Towards the convergence of theory and practice: a technology guide for scheduling\/planning methodology. In Proceedings of Foundations in Computer-Aided Operations (FOCAPO), Snowbird, Utah, 1998."},{"year":"1998","series-title":"Integer programming","author":"Wolsey","key":"10.1016\/S0954-1810(99)00004-7_BIB6"},{"year":"1990","series-title":"Knapsack problems algorithms and computer implementations","author":"Martello","key":"10.1016\/S0954-1810(99)00004-7_BIB7"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB8","unstructured":"Kirschner KJ, Realff MJ. Process modeling of a waste volume reduction facility. An unpublished paper presented at the 1996 AIChE National Conference. Proceedings of the National Meeting of the AIChE, Chicago, 1996."},{"key":"10.1016\/S0954-1810(99)00004-7_BIB9","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","author":"Crowder","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB10","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","article-title":"linear programming approach to the cutting stock problem","author":"Gilmore","year":"1963","journal-title":"Operations Research"},{"year":"1988","series-title":"Integer and combinatorial optimization. Wiley interscience series in discrete mathematics and optimization","author":"Nemhauser","key":"10.1016\/S0954-1810(99)00004-7_BIB11"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB12","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/322003.322010","article-title":"The power of dominance relations in branch bound algorithms","volume":"24","author":"Ibaraki","year":"1977","journal-title":"Journal of the Association of Computing Machinery"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"23","author":"Horowitz","year":"1974","journal-title":"Journal of ACM"},{"year":"1990","series-title":"Explanation based learning: a problem solving perspective. Machine learning, paradigms and methods","author":"Minton","key":"10.1016\/S0954-1810(99)00004-7_BIB14"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(89)90185-9","article-title":"New approaches for heuristic search: A bilateral linkage with artificial intelligence","volume":"39","author":"Glover","year":"1989","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB17","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/0305-0548(94)00056-E","article-title":"Improving the performance of enumerative search methods part i","volume":"22","author":"Fadlalla","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB18","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1016\/0305-0548(95)00016-F","article-title":"Improving the performance of enumerative search methods part ii: Computational experiments","volume":"22","author":"Fadlalla","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB19","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/0377-2217(94)00196-0","article-title":"A strategy for evolution of algorithms to increase the computational effectiveness of np-hard scheduling problems","volume":"88","author":"Li","year":"1996","journal-title":"European Journal of Operations Research"},{"year":"1984","series-title":"Classification and regression trees","author":"Breiman","key":"10.1016\/S0954-1810(99)00004-7_BIB20"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB21","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1109\/32.7626","article-title":"Learning dominance relations in combinatorial search problems","volume":"14","author":"Yu","year":"1988","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB22","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero-one knapsack problems","volume":"28","author":"Balas","year":"1980","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/S0954-1810(99)00004-7_BIB23","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.45.5.768","article-title":"Upper bounds and algorithms for hard 0-1 knapsack problems","volume":"45","author":"Martello","year":"1997","journal-title":"Operations Research"},{"year":"1992","series-title":"Numerical recipes in C: the art of scientific computing","author":"Press","key":"10.1016\/S0954-1810(99)00004-7_BIB24"},{"year":"1994","series-title":"An introduction to computational learning theory","author":"Kearns","key":"10.1016\/S0954-1810(99)00004-7_BIB25"},{"year":"1990","series-title":"Encyclopedia of artificial intelligence","key":"10.1016\/S0954-1810(99)00004-7_BIB26"},{"year":"1984","series-title":"Programming in prolog","author":"Clocksin","key":"10.1016\/S0954-1810(99)00004-7_BIB27"},{"year":"1990","series-title":"Extending explanation-based learning by generalizing the structure of explanations. Research notes in artificial intelligence","author":"Shavlik","key":"10.1016\/S0954-1810(99)00004-7_BIB28"},{"year":"1990","series-title":"A general explanation-based learning mechanism and its application to narrative understanding. Research notes in artificial intelligence","author":"Mooney","key":"10.1016\/S0954-1810(99)00004-7_BIB29"},{"year":"1990","series-title":"Introduction to algorithms","author":"Cormen","key":"10.1016\/S0954-1810(99)00004-7_BIB30"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(78)90197-3","article-title":"Bound procedure and state-space representation of combinatorial optimization problems","volume":"36","author":"Ibaraki","year":"1978","journal-title":"Information and Control"},{"issue":"1","key":"10.1016\/S0954-1810(99)00004-7_BIB32","first-page":"140","article-title":"Steiglitz K","volume":"21","author":"Kohler","year":"1974","journal-title":"Characterization and theoretical comparison of branch and bound algorithm for permutation problem, JACM"},{"year":"1985","series-title":"Statistical analysis of finite mixture distributions","author":"Titterington","key":"10.1016\/S0954-1810(99)00004-7_BIB33"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB34","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1214\/aoms\/1177705987","article-title":"Identifiability of mixtures","volume":"31","author":"Teicher","year":"1961","journal-title":"Annals of Mathematical Statistics"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","author":"Dempster","year":"1977","journal-title":"Journal of the Royal Statistical Society B"},{"key":"10.1016\/S0954-1810(99)00004-7_BIB36","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1214\/aos\/1176346060","article-title":"On the convergence properties of the em algorithm","volume":"11","author":"Wu","year":"1983","journal-title":"The Annals of Statistics"},{"year":"1959","series-title":"Testing statistical hypotheses","author":"Lehmann","key":"10.1016\/S0954-1810(99)00004-7_BIB37"},{"year":"1974","series-title":"Introduction to the theory of statistics","author":"Mood","key":"10.1016\/S0954-1810(99)00004-7_BIB38"},{"issue":"1","key":"10.1016\/S0954-1810(99)00004-7_BIB39","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/ijoc.10.1.56","article-title":"On the application of explanation-based learning to acquire control knowledge for branch and bound algorithms","volume":"10","author":"Realff","year":"1998","journal-title":"INFORMS Journal on Computing"}],"container-title":["Artificial Intelligence in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0954181099000047?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0954181099000047?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T04:14:57Z","timestamp":1733285697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0954181099000047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0954181099000047"],"URL":"https:\/\/doi.org\/10.1016\/s0954-1810(99)00004-7","relation":{},"ISSN":["0954-1810"],"issn-type":[{"type":"print","value":"0954-1810"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}