{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:36:38Z","timestamp":1725496598893},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402107"},{"type":"electronic","value":"9783540448686"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44868-3_57","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T19:49:24Z","timestamp":1196365764000},"page":"446-453","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cooperative Ant Colonies for Solving the Maximum Weighted Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Habiba","family":"Drias","sequence":"first","affiliation":[]},{"given":"Aminc","family":"Taibi","sequence":"additional","affiliation":[]},{"given":"Sofianc","family":"Zckour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"57_CR1","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C: Applying the ant system to the vehicle routing problem, in 2nd Metaheuristics Int Conf, MIC 97, Sophia-Antipolis, France, (July 1997)"},{"key":"57_CR2","unstructured":"Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant Algorithms for discrete optimization, Tech Rep iridia\/98-10, Universit\u00e9 libre de Bruxelles, 1998"},{"issue":"1","key":"57_CR3","first-page":"39","volume":"34","author":"A. Colorni","year":"1994","unstructured":"Colorni, A., Dorigo, M, Maniezzo, V., Trubian, M: Ant system for Job-Shop Scheduling, Jorbel, 34(1), 39\u201353, (1994)","journal-title":"Jorbel"},{"key":"57_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Algorithms for the Traveling Salesman Problem, Biosystems, 43, 73\u201381, (1997)","journal-title":"Biosystems"},{"key":"57_CR5","unstructured":"Dorigo, M., Caro, G.D.: Ant Colony Optimization: A New meta heuristic, IEEE, (1999)."},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Drias, H.,, \u2018Scatter search with random walk strategy for solving hard MAX-W-SAT problems\u2019, in proc of IEA-AIE\u20192001, LNAI 2070, Springer, Budapest, 3544, (2001).","DOI":"10.1007\/3-540-45517-5_5"},{"key":"57_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1007\/3-540-45720-8_70","volume-title":"Genetic Algorithm versus Scatter search and solving hard MAX-W-SAT problems","author":"H. Drias","year":"2001","unstructured":"Drias, H., \u2018Genetic Algorithm versus Scatter search and solving hard MAX-W-SAT problems\u2019, in proc of IWANN\u20192001, LNCS 2084, (2001) Granada, vol 1 586\u2013593"},{"key":"57_CR8","series-title":"Technical Report","volume-title":"Ant Algorithms for the QAP","author":"L.M. Gambardella","year":"1997","unstructured":"Gambardella, L.M., Taillard, E., Dorigo, M.: Ant Algorithms for the QAP, Technical Report 974, IDSIA, Lugano, Switzerland, (1997)"},{"key":"57_CR9","unstructured":"Glover, F., Laguna M., Marti, R.: scatter search, internet document, (2000)."},{"key":"57_CR10","first-page":"279","volume":"44","author":"P. Hansen","year":"1990","unstructured":"Hansen P., Jaumard, B.: Algorithms for the Max-SAT, comp 44, 279\u2013303, (1990).","journal-title":"Algorithms for the Max-SAT"},{"key":"57_CR11","first-page":"393405","volume":"35","author":"M.G. Resende","year":"1997","unstructured":"Resende, M.G., Pitsoulis L.S., Pardalos, P.M.: Approximate Solution of Weighted MAX-SAT Problems using GRASP, in Dimacs series on DM and TCS vol 35, 393405, (1997).","journal-title":"Dimacs series on DM and TCS"}],"container-title":["Lecture Notes in Computer Science","Computational Methods in Neural Modeling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44868-3_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:16:17Z","timestamp":1558278977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44868-3_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402107","9783540448686"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44868-3_57","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"18 June 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}