Xu, Xuelin; Gao, Zongsheng; Xu, Ke A tighter upper bound for random MAX \(2\)-SAT. (English) Zbl 1260.68164 Inf. Process. Lett. 111, No. 3, 115-119 (2011). MSC: 68Q17 68Q25 PDF BibTeX XML Cite \textit{X. Xu} et al., Inf. Process. Lett. 111, No. 3, 115--119 (2011; Zbl 1260.68164) Full Text: DOI
Ibaraki, Toshihide; Imamichi, Takashi; Koga, Yuichi; Nagamochi, Hiroshi; Nonobe, Koji; Yagiura, Mutsunori Efficient branch-and-bound algorithms for weighted MAX-2-SAT. (English) Zbl 1216.90073 Math. Program. 127, No. 2 (A), 297-343 (2011). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{T. Ibaraki} et al., Math. Program. 127, No. 2 (A), 297--343 (2011; Zbl 1216.90073) Full Text: DOI
Kulikov, A. S.; Kutskov, K. New upper bounds for the problem of maximal satisfiability. (English. Russian original) Zbl 1234.68154 Discrete Math. Appl. 19, No. 2, 155-172 (2009); translation from Diskretn. Mat. 21, No. 1, 139-157 (2009). MSC: 68Q25 PDF BibTeX XML Cite \textit{A. S. Kulikov} and \textit{K. Kutskov}, Discrete Math. Appl. 19, No. 2, 155--172 (2009; Zbl 1234.68154); translation from Diskretn. Mat. 21, No. 1, 139--157 (2009) Full Text: DOI
Khot, Subhash; Naor, Assaf Linear equations modulo 2 and the \(L_1\) diameter of convex bodies. (English) Zbl 1178.68670 SIAM J. Comput. 38, No. 4, 1448-1463 (2008). MSC: 68W20 68W25 68Q25 52B55 68U05 90C22 PDF BibTeX XML Cite \textit{S. Khot} and \textit{A. Naor}, SIAM J. Comput. 38, No. 4, 1448--1463 (2008; Zbl 1178.68670) Full Text: DOI
Scott, Alexander D.; Sorkin, Gregory B. Linear-programming design and analysis of fast algorithms for Max 2-CSP. (English) Zbl 1153.90505 Discrete Optim. 4, No. 3-4, 260-287 (2007). MSC: 90C05 05C35 05C85 68R10 PDF BibTeX XML Cite \textit{A. D. Scott} and \textit{G. B. Sorkin}, Discrete Optim. 4, No. 3--4, 260--287 (2007; Zbl 1153.90505) Full Text: DOI
Kochenberger, Gary; Glover, fred; Alidaee, Bahram; Lewis, Karen Using the unconstrained quadratic program to model and solve Max 2-SAT problems. (English) Zbl 1100.90059 Int. J. Oper. Res. 1, No. 1-2, 89-100 (2005). MSC: 90C59 68W40 PDF BibTeX XML Cite \textit{G. Kochenberger} et al., Int. J. Oper. Res. 1, No. 1--2, 89--100 (2005; Zbl 1100.90059) Full Text: DOI
Williams, Ryan A new algorithm for optimal 2-constraint satisfaction and its implications. (English) Zbl 1081.68095 Theor. Comput. Sci. 348, No. 2-3, 357-365 (2005). MSC: 68T20 68Q05 PDF BibTeX XML Cite \textit{R. Williams}, Theor. Comput. Sci. 348, No. 2--3, 357--365 (2005; Zbl 1081.68095) Full Text: DOI
Coja-Oghlan, Amin; Goerdt, Andreas; Lanka, André; Schädlich, Frank Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT. (English) Zbl 1086.68143 Theor. Comput. Sci. 329, No. 1-3, 1-45 (2004). MSC: 68W25 68Q25 PDF BibTeX XML Cite \textit{A. Coja-Oghlan} et al., Theor. Comput. Sci. 329, No. 1--3, 1--45 (2004; Zbl 1086.68143) Full Text: DOI
Cheriyan, J.; Cunningham, W. H.; Tunçel, L.; Wang, Y. A linear programming and rounding approach to max 2-sat. (English) Zbl 0864.90102 Johnson, David S. (ed.) et al., Cliques, coloring, and satisfiability. Second DIMACS implementation challenge. Proceedings of a workshop held at DIMACS, October 11–13, 1993. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 395-414 (1996). MSC: 90C27 90C35 90C10 PDF BibTeX XML Cite \textit{J. Cheriyan} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 395--414 (1996; Zbl 0864.90102)