{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T20:39:44Z","timestamp":1774643984523,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319694030","type":"print"},{"value":"9783319694047","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69404-7_5","type":"book-chapter","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T12:43:57Z","timestamp":1508849037000},"page":"64-78","source":"Crossref","is-referenced-by-count":5,"title":["A GRASP for the Minimum Cost SAT Problem"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Felici","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Ferone","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Festa","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Napoletano","sequence":"additional","affiliation":[]},{"given":"Tommaso","family":"Pastore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,25]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"crossref","first-page":"721","DOI":"10.3233\/JAD-2011-101881","volume":"24","author":"I Arisi","year":"2011","unstructured":"Arisi, I., D\u2019Onofrio, M., Brandi, R., Felsani, A., Capsoni, S., Drovandi, G., Felici, G., Weitschek, E., Bertolazzi, P., Cattaneo, A.: Gene expression biomarkers in the brain of a mouse model for alzheimer\u2019s disease: Mining of microarray data by logic classification and feature selection. J. Alzheimer\u2019s Dis. 24(4), 721\u2013738 (2011)","journal-title":"J. Alzheimer\u2019s Dis."},{"issue":"2","key":"5_CR2","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.ejor.2015.09.051","volume":"250","author":"P Bertolazzi","year":"2016","unstructured":"Bertolazzi, P., Felici, G., Festa, P., Fiscon, G., Weitschek, E.: Integer programming models for feature selection: new extensions and a randomized solution algorithm. Eur. J. Oper. Res. 250(2), 389\u2013399 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"14","key":"5_CR3","doi-asserted-by":"crossref","first-page":"S7","DOI":"10.1186\/1471-2105-10-S14-S7","volume":"10","author":"P Bertolazzi","year":"2009","unstructured":"Bertolazzi, P., Felici, G., Weitschek, E.: Learning to classify species with barcodes. BMC Bioinform. 10(14), S7 (2009)","journal-title":"BMC Bioinform."},{"issue":"5","key":"5_CR4","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1093\/bioinformatics\/btv635","volume":"32","author":"V Cestarelli","year":"2016","unstructured":"Cestarelli, V., Fiscon, G., Felici, G., Bertolazzi, P., Weitschek, E.: CAMUR: knowledge extraction from RNA-seq cancer data through equivalent classification rules. Bioinformatics 32(5), 697\u2013704 (2016)","journal-title":"Bioinformatics"},{"key":"5_CR5","first-page":"1","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-boolean constraints into SAT. J. Satisf. Boolean Model. Comput. 2, 1\u201326 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"1","key":"5_CR6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/ijoc.14.1.20.7709","volume":"14","author":"G Felici","year":"2002","unstructured":"Felici, G., Truemper, K.: A minsat approach for learning in logic domains. INFORMS J. Comput. 14(1), 20\u201336 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"5_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"5_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00663.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP - part I: algorithms. Int. Trans. Oper. Res. 16(1), 1\u201324 (2009)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"5_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP - part II: applications. Int. Trans. Oper. Res. 16(2), 131\u2013172 (2009)","journal-title":"Int. Trans. Oper. Res."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Fu, Z., Malik, S.: Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search. In: 2006 IEEE\/ACM International Conference on Computer Aided Design, pp. 852\u2013859, November 2006","DOI":"10.1109\/ICCAD.2006.320089"},{"key":"5_CR11","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. W.H. Freeman, New York (2002)"},{"issue":"5","key":"5_CR12","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/43.998623","volume":"21","author":"VM Manquinho","year":"2002","unstructured":"Manquinho, V.M., Marques-Silva, J.P.: Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 21(5), 505\u2013516 (2002)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Manquinho, V.M., Flores, P.F., Silva, J.P.M., Oliveira, A.L.: Prime implicant computation using satisfiability algorithms. In: Ninth IEEE International Conference on Tools with Artificial Intelligence, 1997 Proceedings, pp. 232\u2013239. IEEE (1997)","DOI":"10.1109\/TAI.1997.632261"},{"issue":"5","key":"5_CR14","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Martins, R., Manquinho, V., Lynce, I.: Clause sharing in deterministic parallel maximum satisfiability. In: RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (2012)","DOI":"10.3233\/AIC-2012-0517"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-642-34413-8_44","volume-title":"Learning and Intelligent Optimization","author":"R Martins","year":"2012","unstructured":"Martins, R., Manquinho, V.M., Lynce, I.: Clause sharing in parallel MaxSAT. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 455\u2013460. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34413-8_44"},{"issue":"2","key":"5_CR17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/AIC-2012-0517","volume":"25","author":"R Martins","year":"2012","unstructured":"Martins, R., Manquinho, V.M., Lynce, I.: Parallel search for maximum satisfiability. AI Commun. 25(2), 75\u201395 (2012)","journal-title":"AI Commun."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference, DAC 2001, pp. 530\u2013535. ACM, New York (2001)","DOI":"10.1145\/378239.379017"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-78800-3_24"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Pipponzi, M., Somenzi, F.: An iterative algorithm for the binate covering problem. In: Proceedings of the European Design Automation Conference, EDAC 1990, pp. 208\u2013211, March 1990","DOI":"10.1109\/EDAC.1990.136646"},{"issue":"3","key":"5_CR21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/itor.12010","volume":"20","author":"CC Ribeiro","year":"2013","unstructured":"Ribeiro, C.C., Rosseti, I., Souza, R.C.: Probabilistic stopping rules for GRASP heuristics and extensions. Int. Trans. Oper. Res. 20(3), 301\u2013323 (2013)","journal-title":"Int. Trans. Oper. Res."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Scholz, F.W.: Maximum likelihood estimation (2004)","DOI":"10.1002\/0471667196.ess1571"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Servit, M., Zamazal, J.: Heuristic approach to binate covering problem. In: Proceedings The European Conference on Design Automation, pp. 123\u2013129, March 1992","DOI":"10.1109\/EDAC.1992.205906"},{"key":"5_CR24","unstructured":"Sorensson, N., Een, N.: Minisat v1.13 - a sat solver with conflict-clause minimization. Technical report (2005(53))"},{"key":"5_CR25","doi-asserted-by":"crossref","DOI":"10.1002\/0471723940","volume-title":"Design of Logic-Based Intelligent Systems","author":"K Truemper","year":"2004","unstructured":"Truemper, K.: Design of Logic-Based Intelligent Systems. Wiley-Interscience Publication, Wiley (2004)"},{"issue":"7","key":"5_CR26","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/43.644030","volume":"16","author":"T Villa","year":"1997","unstructured":"Villa, T., Kam, T., Brayton, R.K., Sangiovanni-Vincenteili, A.L.: Explicit and implicit algorithms for binate covering problems. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 16(7), 677\u2013691 (1997)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Weitschek, E., Felici, G., Bertolazzi, P.: MALA: a microarray clustering and classification software. In: 2012 23rd International Workshop on Database and Expert Systems Applications, pp. 201\u2013205, September 2012","DOI":"10.1109\/DEXA.2012.29"},{"issue":"1","key":"5_CR28","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1186\/1756-0381-7-4","volume":"7","author":"E Weitschek","year":"2014","unstructured":"Weitschek, E., Fiscon, G., Felici, G.: Supervised DNA barcodes species classification: analysis, comparisons and results. BioData Min. 7(1), 4 (2014)","journal-title":"BioData Min."},{"issue":"1","key":"5_CR29","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1186\/1743-422X-9-58","volume":"9","author":"E Weitschek","year":"2012","unstructured":"Weitschek, E., Lo Presti, A., Drovandi, G., Felici, G., Ciccozzi, M., Ciotti, M., Bertolazzi, P.: Human polyomaviruses identification by logic mining techniques. Virol. J. 9(1), 58 (2012)","journal-title":"Virol. J."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69404-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T05:16:45Z","timestamp":1659676605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69404-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319694030","9783319694047"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69404-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}