{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:23:20Z","timestamp":1725909800167},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319569932"},{"type":"electronic","value":"9783319569949"}],"license":[{"start":{"date-parts":[[2017,8,20]],"date-time":"2017-08-20T00:00:00Z","timestamp":1503187200000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-56994-9_26","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T22:08:25Z","timestamp":1503094105000},"page":"368-376","source":"Crossref","is-referenced-by-count":0,"title":["Enhanced WalkSAT with Variable Neighborhood Search for MAX-SAT Problems"],"prefix":"10.1007","author":[{"given":"Noureddine","family":"Bouhmala","sequence":"first","affiliation":[]},{"given":"Mats","family":"Oselan","sequence":"additional","affiliation":[]},{"given":"\u00d8yestein","family":"Br\u00e5dland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,20]]},"reference":[{"key":"26_CR1","unstructured":"Audemard, G., Simon, L: Predicting learnt clauses quality in modern SAT solvers. In: Twenty First International Conferences on Artificial Intelligence, IQ 2009 (2009)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bouhmala, N.: A variable neighborhood search structure based-genetic algorithm for combinatorial optimization problems. Int. J. Hybrid Intell. Syst. Theory Appl. 15(2) (2016)","DOI":"10.1504\/IJISTA.2016.076494"},{"issue":"6","key":"26_CR3","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s13042-015-0355-4","volume":"6","author":"N Bouhmala","year":"2015","unstructured":"Bouhmala, N.: A multilevel learning automata for MAX-SAT. Int. J. Mach. Learn. Cybern. 6(6), 911\u2013921 (2015). doi: 10.1007\/s13042-015-0355-4","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.endm.2014.11.007","volume":"47","author":"N Bouhmala","year":"2015","unstructured":"Bouhmala, N., Hjelmervik, K., Ivar \u00d8vergaard, K.: A generalized variable neighborhood search for combinatorial optimization problems. Electron. Notes Discrete Math. 47, 45\u201352 (2015)","journal-title":"Electron. Notes Discrete Math."},{"issue":"4","key":"26_CR5","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1162\/EVCO_a_00078","volume":"20","author":"N Bouhmala","year":"2012","unstructured":"Bouhmala, N.: A multilevel memetic algorithm for large SAT-encoded problems. Evol. Comput. 20(4), 641\u2013664 (2012)","journal-title":"Evol. Comput."},{"issue":"5","key":"26_CR6","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.engappai.2010.01.009","volume":"23","author":"N Bouhmala","year":"2010","unstructured":"Bouhmala, N., Granmo, O.C.: Combining finite learning automata with GSAT for the satisfiability problem. Eng. Appl. Artif. Intell. 23(5), 715\u2013726 (2010)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"26_CR7","unstructured":"Cai, S., Luo, C., Su. K.: CCASat: solver description. In: Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, pages 1314 (2012)"},{"issue":"III","key":"26_CR8","first-page":"15","volume":"IV","author":"O Granmo","year":"2007","unstructured":"Granmo, O., Bouhmala, N.: Solving the satisfiability problem using finite learning automata. Int. J. Comput. Sci. Appl. IV(III), 15\u201329 (2007). Special Issue on Natural Inspired Computation","journal-title":"Int. J. Comput. Sci. Appl."},{"key":"26_CR9","unstructured":"Hu, B., Raidl, R.: Variable neighborhood descent with self-adaptive neighborhood-ordering. In: Cotta, C., Fernandez, A.J., Gallardo, J.E. (eds.) Proceedings of the 7th EU\/Meeting on Adaptive, Self-Adaptive, and Multi-level Metaheuristics, Malaga, Spain (2006)"},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1023\/A:1011306011437","volume":"7","author":"M Jagiura","year":"2001","unstructured":"Jagiura, M., Ibaraki, T.: Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental evaluation. J. Heurist. 7, 423\u2013442 (2001)","journal-title":"J. Heurist."},{"key":"26_CR11","unstructured":"McAllester, D., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), pp. 321\u2013326 (1997)"},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Prestwich, S.: Random walk with continuously smoothed variable weights. In: Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, vol. 3569, pp. 203\u2013215 (2005)","DOI":"10.1007\/11499107_15"},{"key":"26_CR14","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proceedings of AAAI94, pp. 337\u2013343. MIT Press (1994)"},{"key":"26_CR15","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of AAA92, pp. 440\u2013446. MIT Press (1992)"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Tompkins, A.D., Hoos, H.: UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT, pp. 37\u201346 (2004)","DOI":"10.1007\/11527695_24"}],"container-title":["Lecture Notes in Networks and Systems","Proceedings of SAI Intelligent Systems Conference (IntelliSys) 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56994-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T11:49:10Z","timestamp":1570016950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56994-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,20]]},"ISBN":["9783319569932","9783319569949"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56994-9_26","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2017,8,20]]}}}