{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T14:54:44Z","timestamp":1791125684195,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141850","type":"print"},{"value":"9783642141867","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14186-7_33","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T22:20:37Z","timestamp":1278627637000},"page":"363-368","source":"Crossref","is-referenced-by-count":19,"title":["Exact MinSAT Solving"],"prefix":"10.1007","author":[{"given":"Chu Min","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhe","family":"Quan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-02777-2_39","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"C. Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (weighted) partial MaxSAT through satisfiability testing. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 427\u2013440. Springer, Heidelberg (2009)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. Electr. J. Comb.\u00a012 (2005)","DOI":"10.1007\/978-3-540-30551-4_43"},{"key":"33_CR3","first-page":"569","volume":"58","author":"J. Konc","year":"2007","unstructured":"Konc, J., Janezic, D.: An improved branch and bound algorithm for the maximum clique problem. Communications in Mathematical and in Computer Chemistry\u00a058, 569\u2013590 (2007)","journal-title":"Communications in Mathematical and in Computer Chemistry"},{"key":"33_CR4","first-page":"613","volume-title":"Handbook of Satisfiability","author":"C.M. Li","year":"2009","unstructured":"Li, C.M., Many\u00e0, F.: Max-SAT, hard and soft constraints. In: Biere, A., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, pp. 613\u2013631. IOS Press, Amsterdam (2009)"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.2215","volume":"30","author":"C.M. Li","year":"2007","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: New inference rules for Max-SAT. Journal of Artificial Intelligence Research\u00a030, 321\u2013359 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(96)00031-2","volume":"58","author":"M.V. Marathe","year":"1996","unstructured":"Marathe, M.V., Ravi, S.S.: On approximation algorithms for the minimum satisfiability problem. Information Processing Letters\u00a058, 23\u201329 (1996)","journal-title":"Information Processing Letters"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-642-02777-2_45","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"V.M. Manquinho","year":"2009","unstructured":"Manquinho, V.M., Silva, J.P.M., Planes, J.: Algorithms for weighted boolean optimization. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 495\u2013508. Springer, Heidelberg (2009)"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P.R.J. Ostergard","year":"2002","unstructured":"Ostergard, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics\u00a0120, 197\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14186-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:31:36Z","timestamp":1559255496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14186-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141850","9783642141867"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14186-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}