{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:45:34Z","timestamp":1725479134665},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262763"},{"type":"electronic","value":"9783540316794"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499107_27","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T17:56:25Z","timestamp":1279130185000},"page":"371-377","source":"Crossref","is-referenced-by-count":16,"title":["Improved Exact Solvers for Weighted Max-SAT"],"prefix":"10.1007","author":[{"given":"Teresa","family":"Alsinet","sequence":"first","affiliation":[]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[]},{"given":"Jordi","family":"Planes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-49477-4_12","volume-title":"SOFSEM \u201998: Theory and Practice of Informatics","author":"J. Alber","year":"1998","unstructured":"Alber, J., Gramm, J., Niedermeier, R.: Faster exact algorithms for hard problems: A parameterized point of view. In: Rovan, B. (ed.) SOFSEM 1998. LNCS, vol.\u00a01521, pp. 168\u2013185. Springer, Heidelberg (1998)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"T. Alsinet","year":"2004","unstructured":"Alsinet, T., Many\u00e0, F., Planes, J.: Improved branch and bound algorithms for Max-SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"27_CR3","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 MAX-SAT problems. J.\u00a0of Combinatorial Optimization\u00a02, 299\u2013306 (1999)","journal-title":"J.\u00a0of Combinatorial Optimization"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-45193-8_25","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"S. Givry de","year":"2003","unstructured":"de Givry, S., Larrosa, J., Meseguer, P., Schiex, T.: Solving Max-SAT as weighted CSP. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 363\u2013376. Springer, Heidelberg (2003)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01531077","volume":"1","author":"R.G. Jeroslow","year":"1990","unstructured":"Jeroslow, R.G., Wang, J.: Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence\u00a01, 167\u2013187 (1990)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/jagm.2000.1075","volume":"36","author":"R. Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. Journal of Algorithms\u00a036, 63\u201388 (2000)","journal-title":"Journal of Algorithms"},{"key":"27_CR7","unstructured":"Pretolani, D.: Efficiency and stability of hypergraph SAT algorithms. In: Proceedings of the DIMACS Challenge II Workshop (1993)"},{"key":"27_CR8","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of AAAI 2002, pp. 440\u2013446 (1992)"},{"key":"27_CR9","unstructured":"Shen, H., Zhang, H.: Study of lower bound functions for max-2-sat. In: Proceedings of AAAI 2004, pp. 185\u2013190 (2004)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Wallace, R., Freuder, E.: Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. In: Cliques, Coloring and Satisfiability, vol.\u00a026, pp. 587\u2013615 (1996)","DOI":"10.1090\/dimacs\/026\/28"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-540-30201-8_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"Z. Xing","year":"2004","unstructured":"Xing, Z., Zhang, W.: Efficient strategies for (weighted) maximum satisfiability. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 690\u2013705. Springer, Heidelberg (2004)"},{"key":"27_CR12","unstructured":"Zhang, H., Shen, H., Manya, F.: Exact algorithms for MAX-SAT. In: 4th Int. Workshop on First order Theorem Proving (2003)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:14:13Z","timestamp":1558282453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11499107_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}