Elliptic approximations of propositional formulae

Discrete Applied Mathematics

Volumn 96-97, Issue , 1999, Pages 223-244

  Van Maaren, Hans ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Convexity; Quadratic approximations; Quadratic valid cuts; Satisfiability

Indexed keywords

EID: 0041596789     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00041-4     Document Type: Article

References (8)

1. C. Delorme, S. Poljak, Laplacian eigenvalues and the maximum cut problem, Math. Prog. 62 (1993) 557-574.
2. O. Dubois, Double balanced formulae, DIMACS SAT Workshop, Oral Communication, 1996.
3. J. Gu, P.W. Purdom, J. Franco, B.W. Wah, Algorithms for the Satisfiability (SAT) Problem: a Survey, in: D.Z. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications. DIMACS Series vol. 35, American Mathematical Society, Providence, RI, 1997, pp. 19-151.
4. L. Lovasz, A. Schrijver, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim. 2 (1991) 166-190.
5. H. van Maaren, On the use of second order derivatives for the Satisfiability Problem, in: D.Z. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications, DIMACS Series, 35, American Mathematical Society, Providence, RI, 1997, pp. 677-687.
6. H. van Maaren, J.F. Groote, M. Rozema, Verification of propositional formulae by means of convex and concave transforms, Technical report, no. 95-74, TU Delft, 1995.
7. H.D. Sherali, W.P. Adams, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math. 3 (3) (1990) 411-430.
8. J.P. Warners, H. van Maaren, Satisfiability problems with balanced polynomial representation, Technical report, no. 97-47, TU Delft, 1997.