The Power of Semidefinite Programming Relaxations for MAX-SAT

Lecture Notes in Computer Science - Germany
doi 10.1007/11757375_10
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Semidefinite Programming Relaxations Through Quadratic Reformulation for Box-Constrained Polynomial Optimization Problems

2019English

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Semidefinite Relaxations of Ordering Problems

Mathematical Programming, Series B
MathematicsSoftware
2013English

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

English

Semidefinite Programming

2014English

Semidefinite Programming

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
1996English

Regularization Methods for Semidefinite Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2009English

Randomized Variants of Johnson's Algorithm for MAX SAT

2011English

Nonsymmetric Search Directions for Semidefinite Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy