{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:13:36Z","timestamp":1725603216996},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642236044"},{"type":"electronic","value":"9783642236051"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23605-1_24","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T21:18:10Z","timestamp":1314307090000},"page":"226-237","source":"Crossref","is-referenced-by-count":0,"title":["ABSO: Advanced Bee Swarm Optimization Metaheuristic and Application to Weighted MAX-SAT Problem"],"prefix":"10.1007","author":[{"given":"Souhila","family":"Sadeg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Habiba","family":"Drias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ouassim","family":"Ait El Hara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ania","family":"Kaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/dimacs\/026\/28","volume-title":"Cliques, Coloring and Satisfiability","author":"R. Wallace","year":"1996","unstructured":"Wallace, R., Freuder, E.: Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. In: Johnson, D., Trick, M. (eds.) Cliques, Coloring and Satisfiability, vol.\u00a026, pp. 587\u2013615. American Mathematical Society, Providence (1996)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009725216438","volume":"2","author":"B. Borchers","year":"1999","unstructured":"Borchers, B., Furman, J.: A two-phase exact algorithm for MAX-SAT and weighted MAXSAT problems. J. Combi. Opti.\u00a02, 299\u2013306 (1999)","journal-title":"J. Combi. Opti."},{"key":"24_CR3","unstructured":"Alsinet, T., Many\u00e0, F., Planes, J.: Improved branch and bound algorithms for Max-SAT. In: Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing, S. Margherita Ligure, Portofino, Italy (2003)"},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1007\/978-3-540-30201-8_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"Zhao Xing","year":"2004","unstructured":"Xing, Z., Zhang, W.: Efficient strategies for (weighted) maximum satisfiability. In: Proceedings of CP-2004, Toronto, Canada, pp. 690\u2013705 (2004)"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10898-007-9166-9","volume":"41","author":"A. Alsinet","year":"2008","unstructured":"Alsinet, A., Many\u00e0, F., Planes, J.: An efficient solver for weighted Max-SAT. Journal of Global Optimization\u00a041(1), 61\u201373 (2008)","journal-title":"Journal of Global Optimization"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM\u00a05, 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"24_CR7","unstructured":"Selman, B., Henry, A., Kautz, Z., Cohen, B.: Local Search Strategies for Satisfiability Testing. Presented at the second DIMACS Challenge on Cliques, Coloring, and Satisfiability (October 1993)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Frank, J.: A study of genetic algorithms to find approximate solutions to hard 3CNF problems. In: Proceedings of Golden West International Conference on Artificial Intelligence (1994)","DOI":"10.1007\/978-94-011-7108-3_57"},{"key":"24_CR9","unstructured":"Mazure, B., Sais, L., Greroire, E.: A Tabu search for Sat. In: Proceedings of AAAI (1997)"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/dimacs\/035\/11","volume-title":"Satisfiability Problem: Theory and Applications","author":"M. Resende","year":"1997","unstructured":"Resende, M., Pitsoulis, L., Pardalos, P.: Approximate solutions of weighted MAX-SAT problems using GRASP. In: Du, D.-Z., Gu, J., Pardalos, P. (eds.) Satisfiability Problem: Theory and Applications, pp. 393\u2013405. American Mathematical Society, Providence (1997)"},{"key":"24_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45517-5_5","volume-title":"Engineering of Intelligent Systems","author":"H. Drias","year":"2001","unstructured":"Drias, H.: Scatter search with random walk strategy for SAT and MAX-W-SAT problems. In: Monostori, L., V\u00e1ncza, J., Ali, M. (eds.) IEA\/AIE 2001. LNCS (LNAI), vol.\u00a02070, pp. 35\u201344. Springer, Heidelberg (2001)"},{"key":"24_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44868-3_57","volume-title":"Cooperative Ant Colonies for Solving the Maximum Weighted Satisfiability Problem","author":"H. Drias","year":"2003","unstructured":"Drias, H., Taibi, A., Zekour, S.: Cooperative Ant Colonies for Solving the Maximum Weighted Satisfiability Problem. Springer, Heidelberg (2003)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Boughaci, D., Drias, H.: Solving Weighted Max-Sat Optimization Problems Using a Taboo Scatter Search Meta-heuristic. In: Proceedings of ACM SAC 2004, pp. 35\u201336 (2004)","DOI":"10.1145\/967900.967910"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11494669_39","volume-title":"Computational Intelligence and Bioinspired Systems","author":"H. Drias","year":"2005","unstructured":"Drias, H., Sadeg, S., Yahi, S.: Cooperative Bees Swarm for Solving the Maximum Weighted Satisfiability Problem. In: Cabestany, J., Prieto, A.G., Sandoval, F. (eds.) IWANN 2005. LNCS, vol.\u00a03512, pp. 318\u2013325. Springer, Heidelberg (2005)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1146\/annurev.en.01.010156.000401","volume":"1","author":"K. Frisch Von","year":"1956","unstructured":"Von Frisch, K., Lindauer, M.: The \u201clanguage\u201d and orientation of the honey bee. Annu. Rev. Entomol.\u00a01, 45\u201358 (1956)","journal-title":"Annu. Rev. Entomol."},{"key":"24_CR16","doi-asserted-by":"publisher","DOI":"10.1515\/9781400857876","volume-title":"Honeybee ecology: a study of adaptation in social life","author":"T. Seeley","year":"1985","unstructured":"Seeley, T.: Honeybee ecology: a study of adaptation in social life. Princeton University Press, Princeton (1985)"},{"issue":"3","key":"24_CR17","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"David S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximate Algorithmic for combinatorial Problems. Journal of Computer and System Sciences, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Brain Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23605-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T08:54:16Z","timestamp":1560502456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23605-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642236044","9783642236051"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23605-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}