On Semidefinite Programming Relaxations of (2+p)-SAT - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Etienne de Klerk, Hans van Maaren. On Semidefinite Programming Relaxations of (2+p)-SAT. Annals of Mathematics and Artificial Intelligence, 37(3):285-305, 2003.

The following publications are possibly variants of this publication:

Relaxations of the Satisfiability Problem Using Semidefinite ProgrammingEtienne de Klerk, Hans van Maaren, Joost P. Warners. JAR, 24(1/2):37-65, 2000.

Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman ProblemEtienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov. siamjo, 20(2):1132, 2009. [doi]

On Semidefinite Programming Relaxations of the Traveling Salesman ProblemEtienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov. siamjo, 19(4):1559-1573, 2008. [doi]

runs on WebDSL