Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT

Discrete Applied Mathematics

Volumn 107, Issue 1-3, 2000, Pages 225-239

  Van Maaren, Hans ^a   Warners, Joost P ^b  

^a DelftUnivTechnol KatholiekeUniv   (Netherlands)

^b KPN RESEARCH   (Netherlands)

Author keywords

90C20 Quadratic programming; 90C27 Combinatorial optimization; Approximation algorithms; Binary programming; Combinatorial optimization

Indexed keywords

EID: 0346424966     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00263-8     Document Type: Article

References (20)

1. F. Alizadeh, Combinatorial optimization with interior point methods and semi-definite matrices, Ph.D. Thesis, University of Minnesota, Minneapolis, USA, 1991.
2. Aspvall B., Plass M.F., Tarjan R.E. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inform. Process. Lett. 8(3):1979;121-123.
3. Delorme C., Poljak S. Laplacian eigenvalues and the maximum cut problem. Math. Programming. 62:1993;557-574.
4. Delorme C., Poljak S. The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Discrete Math. 111:1993;145-156.
5. D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 35, American Mathematical Society, Providence, RI, 1997.
6. U. Feige, M. Goemans, Approximating the value of two prover proof systems with applications to MAX 2SAT and MAX DICUT, Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995, pp. 182-189.
7. Garey M.R., Johnson D.S., Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1:1976;237-267.
8. Goemans M.X., Williamson D.P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM. 42(6):1995;1115-1145.
9. P.L. Hammer, A.A. Rubin, Some remarks on quadratic programming with 0-1 variables, Rev. Française Informat. Recherche Opérationelle 4 (1970) ser. V-3, 67-79.
10. Helmberg C., Rendl F., Vanderbei R.J., Wolkowicz H. An interior-point method for semidefinite programming. SIAM J. Optim. 6(2):1996;342-361.
11. Johnson D.S. Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9:1974;256-278.
12. S. Joy, J. Mitchell, B. Borchers, A branch and cut algorithm for MAX-SAT and weighted MAX-SAT, in: D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 35, American Mathematical Society, Providence, RI, 1997.
13. Karmarkar N., Resende M.G.C., Ramakrishnan K.G. An interior point algorithm to solve computationally difficult set covering problems. Math. Programming. 52:1991;597-618.
14. Körner F. A tight bound for the Boolean quadratic optimization problem and its use in a branch and bound algorithm. Optimization. 19(5):1988;711-721.
15. Körner F. On duality for Boolean programming. European J. Oper. Res. 46(3):1990;399-403.
16. Van Maaren H. Elliptic approximations of propositional formulae. Discrete Appl. Math. 96-97:1999;223-244.
17. H. Van Maaren, On the use of second order derivatives for the satisfiability problems, in: D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 35, American Mathematical Society, Providence, RI, 1997, pp. 677-687.
18. Poljak S., Rendl F. Solving the max-cut problem using eigenvalues. Discrete Appl. Math. 62:1995;249-278.
19. Warners J.P. A linear-time transformation of linear inequalities into conjunctive normal form. Inform. Process. Lett. 68:1998;63-69.
20. Ye Y. On affine scaling algorithms for nonconvex quadratic programming. Math. Programming. 56:1992;285-300.