{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T17:22:32Z","timestamp":1780593752833,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540249375","type":"print"},{"value":"9783540318521","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31852-1_33","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:34:34Z","timestamp":1268382874000},"page":"280-287","source":"Crossref","is-referenced-by-count":10,"title":["Ant Colony Optimization for Multiple Knapsack Problem and Model Bias"],"prefix":"10.1007","author":[{"given":"Stefka","family":"Fidanova","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","first-page":"11","volume-title":"New Idea in Optimization","author":"M. Dorigo","year":"1999","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. McGraw-Hill, New York (1999)"},{"key":"33_CR2","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"},{"issue":"3","key":"33_CR3","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":"33_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"},{"key":"33_CR5","doi-asserted-by":"crossref","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":"33_CR6","doi-asserted-by":"crossref","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":"33_CR7","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 (1999)","DOI":"10.1109\/CEC.1999.782655"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01585758","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":"33_CR9","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. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"33_CR10","first-page":"56","volume":"20","author":"A.A. Schaffer","year":"1991","unstructured":"Schaffer, A.A., Yannakakis, M.: Simple Local Search Problems that are Hard to Solve. Society for Industrial Applied Mathematics Journal on Computing\u00a020, 56\u201387 (1991)","journal-title":"Society for Industrial Applied Mathematics Journal on Computing"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Wolpert, D., Macready, W.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation, 67\u201382 (1997)","DOI":"10.1109\/4235.585893"}],"container-title":["Lecture Notes in Computer Science","Numerical Analysis and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31852-1_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:29:26Z","timestamp":1605742166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31852-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249375","9783540318521"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31852-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}