{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:49:14Z","timestamp":1725529754408},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540788256"},{"type":"electronic","value":"9783540788270"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78827-0_62","type":"book-chapter","created":{"date-parts":[[2009,3,25]],"date-time":"2009-03-25T01:25:05Z","timestamp":1237944305000},"page":"545-552","source":"Crossref","is-referenced-by-count":4,"title":["Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Stefka","family":"Fidanova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-36","author":"W. Diffe","year":"1976","unstructured":"Diffe, W., Hellman, M.E.: New direction in cryptography. IEEE Trans. Inf. Theory\u00a0IT-36, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"62_CR2","unstructured":"Dorigo, M., Di Caro, G.: The Ant Colony Optimization metaheuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Idea in Optimization, pp. 11\u201332. McGrow-Hill (1999)"},{"key":"62_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant Algorithms for Distributed Discrete Optimization. J. of Artificial Life\u00a05, 137\u2013172 (1999)","journal-title":"J. of Artificial Life"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Colony System: A cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transaction on Evolutionary Computation\u00a01, 53\u201366 (1999)","journal-title":"IEEE Transaction on Evolutionary Computation"},{"issue":"3","key":"62_CR5","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1137\/S1052623493254455","volume":"6","author":"C.E. Ferreira","year":"1996","unstructured":"Ferreira, C.E., Martin, A., Weismantel, R.: Solving Multiple Knapsack Problems by Cutting Planes. SIAM Journal on Optimization\u00a06(3), 858\u2013877 (1996)","journal-title":"SIAM Journal on Optimization"},{"key":"62_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"M.L. Gambardella","year":"1999","unstructured":"Gambardella, M.L., Taillard, E.D., Dorigo, M.: Ant Colonies for the QAP. J. of Oper. Res. Soc.\u00a050, 167\u2013176 (1999)","journal-title":"J. of Oper. Res. Soc."},{"key":"62_CR7","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1111\/j.1540-5915.1974.tb00593.x","volume":"5","author":"G. Kochenberger","year":"1974","unstructured":"Kochenberger, G., McCarl, G., Wymann, F.: A Heuristic for General Integer Programming. J. of Decision Sciences\u00a05, 34\u201344 (1974)","journal-title":"J. of Decision Sciences"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Leguizamon, G., Michalevich, Z.: A New Version of Ant System for Subset Problems. In: Proceedings of Int. Conf. on Evolutionary Computations, Washington, pp. 1459\u20131464 (1999)","DOI":"10.1109\/CEC.1999.782655"},{"issue":"1","key":"62_CR9","first-page":"73","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line Knapsack Problems. J. of Mathematical Programming\u00a068(1), 73\u2013104 (1995)","journal-title":"J. of Mathematical Programming"},{"key":"62_CR10","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/mnsc.30.6.765","volume":"30","author":"S. Martello","year":"1984","unstructured":"Martello, S., Toth, P.: A mixtures of dynamic programming and branch-and-bound for the subset-sum proble. Management Science\u00a030, 756\u2013771 (1984)","journal-title":"Management Science"},{"key":"62_CR11","first-page":"1","volume-title":"Metaheuristic: Theory and Applications","author":"I.H. Osman","year":"1996","unstructured":"Osman, I.H., Kelley, J.P.: Metaheuristic: An Overview. In: Osman, I.H., Kelley, J.P. (eds.) Metaheuristic: Theory and Applications, pp. 1\u201321. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"62_CR12","first-page":"503","volume":"27","author":"A. Sinha","year":"1979","unstructured":"Sinha, A., Zoltner, A.A.: The multiple-choice knapsack problem. J. of Operational Research\u00a027, 503\u2013515 (1979)","journal-title":"J. of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78827-0_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T01:58:19Z","timestamp":1551923899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78827-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540788256","9783540788270"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78827-0_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}