The power of semidefinite programming relaxations for MAX-SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3990 LNCS, Issue , 2006, Pages 104-118

  Gomes, Carla P ^a   Van Hoeve, Willem Jan ^a   Leahu, Lucian ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; HEURISTIC METHODS; ITERATIVE METHODS; OPTIMAL SYSTEMS;

CONSTRAINEDNESS REGIONS; MAX-2-SAT; OPTIMAL SOLUTION; SEMIDEFINITE PROGRAMMING (SDP);

LINEAR PROGRAMMING;

EID: 33746031802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757375_10     Document Type: Conference Paper

References (19)

1. Hooker, J.N., Fedjiki, C.: Branch-and-cut solution of inference problems in prepositional logic. Annals of Math, and Artificial Intelligence 1 (1990)
2. Warners, J.: Nonlinear approaches to satisfiability problems. PhD thesis, Technische Universiteit Eindhoven (1999)
3. Xing, Z., Zhang, W.: Maxsolver: An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence 164(1-2) (2005) 47-80
4. Joy, S., Mitchell, J., Horchers, B.: A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. Satisfiability Problem: Theory and Applications 35 (1997) 519-536
5. Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization 5(1) (1995) 13-51
6. Goemans, M., Rendl, F.: Combinatorial Optimization. In Wolkowicz, H., Saigal, R., Vandenberghe, L., eds.: Handbook of Semidefinite Programming. Kluwer (2000) 343-360
7. Grötschel, M., Lovasz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. John Wiley & Sons (1988)
8. Goemans, M., Williamson, D.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM 42(6) (1995) 1115-1145
9. Hochbaum, D.S.: (Editor) Approximation algorithms for NP-Hard problems. PWS Publishing Company (1997)
10. U. Feige and M. Goemans: Approximating the value of two prover proof systems, with applications to max2sat and max dicut. In: Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems. (1995)
11. Garey, M., Johnson, D.: Computers and Intractibility. Freeman (1979)
12. Chvátal, V., Reed, B.: Mike gets some (the odds are on his side). In: 33th Annual Symposium of Foundations of Computer Science. (1992) 620-627
13. Lewin, M., Livnat, D., Zwick, U.: Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In: IPCO. (2002) 67-82
14. Anjos, M.: Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems. Journal on Satisfiability, Boolean Modeling and Computation 1 (2005) 1-47
15. de Klerk, E., van Maaren, H.: On semidefinite programming relaxation of 2+p-sat. Annals of Math, and Artificial Intelligence 37 (2003)
16. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)
17. Selman, B.: Mwff - a program for generating random MAX k-SAT instances. (1993)
18. Borchers, B.: A C Library for Semidefinite Programming. Optimization Methods and Software 11(1) (1999) 613-623 http://www.nmt.edu/~borchers/csdp. html.
19. Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing (1996)