{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:05:56Z","timestamp":1648656356498},"reference-count":23,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2012,8,24]],"date-time":"2012-08-24T00:00:00Z","timestamp":1345766400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"DOI":"10.1007\/s10852-012-9202-8","type":"journal-article","created":{"date-parts":[[2012,8,23]],"date-time":"2012-08-23T05:53:43Z","timestamp":1345701223000},"source":"Crossref","is-referenced-by-count":0,"title":["Analysis and Solving SAT and MAX-SAT Problems Using an L-partition Approach"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kolokolov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Adelshin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darya","family":"Yagofarova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,24]]},"reference":[{"key":"9202_CR1","unstructured":"Adelshin, A.V.: Maximum satisfiability problem and some algorithms of integer programming. In: Eremin, I.I., Machnev, A.A. (eds.) Proc. of International Workshop \u201cAlgebra and Linear Optimization\u201d, pp. 235\u2013239. Ekaterinburg (in Russian) (2002)"},{"issue":"3","key":"9202_CR2","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1023\/B:AURC.0000019369.16127.34","volume":"65","author":"AV Adelshin","year":"2004","unstructured":"Adelshin, A.V.: Investigation of maximum and minimum satisfiability problems using L-partition. Autom. Remote Control 65(3), 388\u2013395 (2004)","journal-title":"Autom. Remote Control"},{"issue":"4","key":"9202_CR3","doi-asserted-by":"crossref","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. Comb. Optim. 2(4), 299\u2013306 (1999)","journal-title":"J. Comb. Optim."},{"key":"9202_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1090\/dimacs\/026\/19","volume":"26","author":"J Cheriyan","year":"1996","unstructured":"Cheriyan, J., Cunningham, W.H., et al.: A Linear programming and rounding approach to max 2-sat. DIMACS Ser. Discret. Math. Theor. Comput. Sci. 26, 395\u2013414 (1996)","journal-title":"DIMACS Ser. Discret. Math. Theor. Comput. Sci."},{"key":"9202_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedure. In: Proc. 3rd Annual ACM Symposium on the Theory of Computing, pp. 151\u2013159 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"3","key":"9202_CR6","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/978-3-540-74484-9_60","volume":"4707","author":"M Cruz-Chavez","year":"2007","unstructured":"Cruz-Chavez, M., Rivera-Lopez, R.: A local search algorithm for a SAT representation of scheduling problems. Lect. Notes Comput. Sci. 4707(3), 697\u2013709 (2007)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9202_CR7","first-page":"1","volume":"12","author":"E Dantsin","year":"2001","unstructured":"Dantsin, E., Hirsch, E.A., Ivanov, S., Vsemirnov, M.: Algorithms for SAT and upper bounds on their complexity. Electron. Colloq. Comput. Complex. 12, 1\u201319 (2001)","journal-title":"Electron. Colloq. Comput. Complex."},{"key":"9202_CR8","unstructured":"Eremeev, A.V., Kolokolov, A.A., Zaozerskaya, L.A.: A hybrid algorithm for the set covering problem. In: Proc. of International Workshop \u201cDiscrete Optimization Methods in Design\u201d, pp.\u00a0123\u2013129. Minsk (2000)"},{"key":"9202_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/dimacs\/035\/02","volume":"35","author":"J Gu","year":"1997","unstructured":"Gu, J., Purdom, P.W., et al.: Algorithms for the satisfiability (SAT) problem: a survey. DIMACS Ser. Discret. Math. Theor. Comput. Sci. 35, 19\u2013151 (1997)","journal-title":"DIMACS Ser. Discret. Math. Theor. Comput. Sci."},{"key":"9202_CR10","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1134\/S0005117908100147","volume":"69","author":"ON Guseletova","year":"2008","unstructured":"Guseletova, O.N., Kolokolov, A.A.: Discrete optimization with logical constraints for design of complex products. Autom. Remote Control 69, 1808\u20131813 (2008)","journal-title":"Autom. Remote Control"},{"key":"9202_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02241270","volume":"4","author":"P Hansen","year":"1990","unstructured":"Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 4, 279\u2013303 (1990)","journal-title":"Computing"},{"key":"9202_CR12","doi-asserted-by":"crossref","unstructured":"Kallrath, J.: Gemischt-Ganzzahlige Optimierung: Modellierung in der Praxis. Vieweg, Wiesbaden (2002)","DOI":"10.1007\/978-3-322-80219-4"},{"key":"9202_CR13","doi-asserted-by":"crossref","unstructured":"Kolokolov, A.A.: Regular partitions and cuts in the integer programming. In: Discrete Analysis and Operations Research, pp. 59\u201379. Kluver Academic, Netherlands (1996)","DOI":"10.1007\/978-94-009-1606-7_6"},{"key":"9202_CR14","unstructured":"Kolokolov, A.A., Cheredova, J.N.: Research and solving the SAT problem using L-partition. In: Proc. International Conference \u201cDiscrete Analysis and Operations Research\u201d, p. 150 (in\u00a0Russian) (2000)"},{"issue":"90","key":"9202_CR15","first-page":"234","volume":"2","author":"AA Kolokolov","year":"2010","unstructured":"Kolokolov, A.A., Yarosh, A.V.: Computer-aided design of complex products using discrete optimization and information technologies. Omsk Sci. Bull. 2(90), 234\u2013238 (in Russian) (2010)","journal-title":"Omsk Sci. Bull."},{"key":"9202_CR16","unstructured":"Kolokolov, A.A., Adelshin, A.V., Cheredova, J.N.: Application of L-partition to investigation of some satisfiability problems. In: Proc. 12th Baikal International Conference \u201cOptimization Methods and Their Applications\u201d, pp. 166\u2013172 (in Russian) (2001)"},{"key":"9202_CR17","unstructured":"Kolokolov, A., Kallrath, J., Yagofarova, D.: Analysis and solving the satisfiability problem using L-partition. In: Proc. Annual International Conference of the GOR, p. 128. Heidelberg (2003)"},{"key":"9202_CR18","unstructured":"Kolokolov, A.A., Adelshin, A.V., Yagofarova, D.I.: Local search algorithms for the MAX SAT problem based on L-class enumeration. In: 18th Mini Euro Conference on VNS: Extended Abstracts, pp. 117\u2013118. Tenerife (2005)"},{"issue":"39","key":"9202_CR19","first-page":"57","volume":"5","author":"AA Kolokolov","year":"2006","unstructured":"Kolokolov, A.A., Yagofarova, D.I, Tyuryumov, A.N.: Using L-class enumeration method in local search algorithms for the maximum satisfiability problem. Omsk Sci. Bull. 5(39), 57\u201361 (in Russian) (2006)","journal-title":"Omsk Sci. Bull."},{"key":"9202_CR20","first-page":"54","volume":"2","author":"AA Kolokolov","year":"2009","unstructured":"Kolokolov, A.A., Adelshin, A.V., Yagofarova, D.I.: Solving the satisfiability problem using an L-class enumeration method. Inf. Technol. 2, 54\u201359 (in Russian) (2009)","journal-title":"Inf. Technol."},{"key":"9202_CR21","unstructured":"Yagofarova, D.I.: Analysis of L-structure of 2-SAT problem. In: Proc. Annual Scientific Conference \u201cUnder Symbol \u03a3\u201d, pp. 71\u201377. Omsk, Russia (in Russian) (2003)"},{"key":"9202_CR22","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.artint.2006.11.005","volume":"171","author":"Q Yang","year":"2007","unstructured":"Yang, Q., Wu, K., Jiang, Y.: Learning action models from plan examples using weighted MAX-SAT. Artif. Intell. 171, 107\u2013143 (2007)","journal-title":"Artif. Intell."},{"key":"9202_CR23","unstructured":"Yarosh, A., Kolokolov, A.: On solving some complex design problems using discrete optimization models. In: Proc. Annual International Conference of the GOR, p. 136. Heidelberg (2003)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-012-9202-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-012-9202-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-012-9202-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:33Z","timestamp":1559269593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-012-9202-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,24]]},"references-count":23,"alternative-id":["9202"],"URL":"https:\/\/doi.org\/10.1007\/s10852-012-9202-8","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,24]]}}}