{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T08:02:39Z","timestamp":1721808159807},"reference-count":20,"publisher":"International Academy Publishing (IAP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSW"],"DOI":"10.4304\/jsw.9.1.104-110","type":"journal-article","created":{"date-parts":[[2014,1,29]],"date-time":"2014-01-29T16:07:23Z","timestamp":1391011643000},"source":"Crossref","is-referenced-by-count":3,"title":["Estimation of Distribution Algorithms for Knapsack Problem"],"prefix":"10.17706","volume":"9","author":[{"given":"Shang","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cungen","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2014,1,1]]},"reference":[{"key":"ref1","first-page":"671","article-title":"Parallel Approximation Schemes for Subset Sum and Knapsack Problems.","volume-title":"22nd Annual Allerton Conference on Communication Control and Computing","author":"Peters","year":"1984","unstructured":"[1] J. Peters, L. Rudolph. Parallel Approximation Schemes for Subset Sum and Knapsack Problems. In 22nd Annual Allerton Conference on Communication, Control and Computing, 1984, pp.671-680."},{"key":"ref2","first-page":"444","article-title":"Parallel Approximate Algorithms for the 0-1 Knapsack Problem.","volume-title":"Proceedings of the International Conference on Parallel Processing","author":"Gopalakrishnan","year":"1986","unstructured":"[2] P.S. Gopalakrishnan, I.V. Ramakrishnan, L.N. Kanal. Parallel Approximate Algorithms for the 0-1 Knapsack Problem. In Proceedings of the International Conference on Parallel Processing, 1986, pp 444-451."},{"key":"ref3","first-page":"434","article-title":"Benjamin W.Wah. Systolic Processing for Dynamic Programming Problems.","volume-title":"Proceedings of the International Conference on Parallel Processing","year":"1985","unstructured":"[3] Guo-jie Li, Benjamin W.Wah. Systolic Processing for Dynamic Programming Problems. In Proceedings of the International Conference on Parallel Processing, 1985, pp.434-441."},{"key":"ref4","first-page":"917","article-title":"Lipton, Daniel Lopresti. Delta Transformations to Simplify VLSI Processor Arrays for Serial Dynamic Programming.","volume-title":"Proceedings of the International Conference on Parallel Processing","author":"Richard","year":"1986","unstructured":"[4] Richard J. Lipton, Daniel Lopresti. Delta Transformations to Simplify VLSI Processor Arrays for Serial Dynamic Programming. In Proceedings of the International Conference on Parallel Processing, 1986, pp.917-920."},{"key":"ref5","first-page":"123","article-title":"On the Parallel Computation for the Knapsack Problem.","volume-title":"13th Annual ACM Symposium on Theory of Computing","author":"Yao","year":"1981","unstructured":"[5] Andrew Chi-Chin Yao. On the Parallel Computation for the Knapsack Problem. In 13th Annual ACM Symposium on Theory of Computing, 1981, pp. 123-127."},{"key":"ref6","first-page":"92","volume-title":"Algorithm design and analysis","author":"Xiaodong","year":"2001","unstructured":"[6] Wang Xiaodong. Algorithm design and analysis. Beijing: Electronic Industry Press,2001, pp.92-168.(In Chinese)"},{"key":"ref7","first-page":"17","volume-title":"Intelligent optimization algorithm and its application","author":"Ling","year":"2001","unstructured":"[7] Wang Ling. Intelligent optimization algorithm and its application, Beijing: Tsinghua University Press,2001:17-59. (In Chinese)"},{"issue":"no.6","key":"ref8","first-page":"561","article-title":"Jin huimin,Ma Liang. Genetic annealing evolutionary algorithm applied to the knapsack problem.","volume":"26","year":"2004","unstructured":"[8] Jin huimin,Ma Liang. Genetic annealing evolutionary algorithm applied to the knapsack problem. Journal of University Of Shanghai for Science And Technology, 2004, vol.26, no.6, pp.561-564. (In Chinese)","journal-title":"Journal of University Of Shanghai for Science And Technology"},{"issue":"8","key":"ref9","first-page":"4","article-title":"Ant optimization algorithm for knapsack problem","volume":"21","author":"Liang","year":"2001","unstructured":"[9] Ma Liang,Wang Longde. Ant optimization algorithm for knapsack problem, Computer Applications . 2001, 21(8), pp. 4-5. (In Chinese)","journal-title":"Computer Applications"},{"issue":"11","key":"ref10","first-page":"94","article-title":"Solving Knapsack Problem by Hybrid Particle Swarm Optimization Algorithm.","volume":"8","author":"Shang","year":"2006","unstructured":"[11] Gao Shang, Yang Jingyu. Solving Knapsack Problem by Hybrid Particle Swarm Optimization Algorithm. Engineering science,2006,8(11), pp. 94-98. (In Chinese)","journal-title":"Eng Sci","ISSN":"http:\/\/id.crossref.org\/issn\/0013-7812","issn-type":"print"},{"issue":"3","key":"ref11","first-page":"669","article-title":"Solution to the 0-1 knapsack problem based on DNA encoding and computing method.","volume":"8","author":"Lian","year":"2013","unstructured":"[12] Ye Lian, Zhang Min. Solution to the 0-1 knapsack problem based on DNA encoding and computing method. Journal of Computers, 2013, 8(3), p 669-675.","journal-title":"Journal of Computers"},{"issue":"2","key":"ref12","first-page":"302","article-title":"Jiao Yong-Chang. MOEA\/D with uniform design for solving multiobjective knapsack problems.","volume":"8","year":"2013","unstructured":"[13] Tan Yan-Yan, Jiao Yong-Chang. MOEA\/D with uniform design for solving multiobjective knapsack problems. Journal of Computers, 2013, 8(2),pp.302-307.","journal-title":"Journal of Computers"},{"key":"ref13","volume-title":"Population based incremental learning","author":"Baluja","year":"1994","unstructured":"[14] Shumeet Baluja. Population based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report, No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1994."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1360\/aas-007-0113"},{"key":"ref15","first-page":"178","article-title":"From recombination of genes to the estimation of distributions I. binary parameters.","volume-title":"Lecture notes in computer science","volume":"1141","author":"Muhliebe","year":"1996","unstructured":"[16] H. Muhliebe, G. Paass. From recombination of genes to the estimation of distributions I. binary parameters. In Lecture notes in computer science. Berlin, Germany: Springer Verlag, 1996, vol.1141, pp.178-187."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/106365600750078808"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4156\/aiss.vol4.issue17.35"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.4156\/jcit.vol7.issue3.13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.4156\/jcit.vol6.issue8.25"},{"issue":"1","key":"ref20","first-page":"108","article-title":"Radar emitter signal analysis with estimation of distribution algorithms.","volume":"8","author":"Haina","year":"2013","unstructured":"[22] Rong Haina, Cheng Jixiang, Li Yuquan. Radar emitter signal analysis with estimation of distribution algorithms. Journal of Networks, 2013, 8(1), p 108-115.","journal-title":"Journal of Networks"}],"container-title":["Journal of Software"],"original-title":[],"deposited":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T15:26:10Z","timestamp":1442330770000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jsw\/article\/view\/10438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,1]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2014,1,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jsw.9.1.104-110","relation":{},"ISSN":["1796-217X"],"issn-type":[{"value":"1796-217X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,1,1]]}}}