Related content

On semidefinite programming relaxations for the satisfiability problem

By Anjos Miguel F.  

Mathematical Methods of Operations Research, Vol. 60, Iss. 3, 2004-12 ,pp. : 349-367

Springer Publishing Company

Access to resources Recommend Favorite

Disjunctive cuts for continuous linear bilevel programming

By Audet Charles   Haddad Jean   Savard Gilles  

Optimization Letters, Vol. 1, Iss. 3, 2007-06 ,pp. : 259-267

Springer Publishing Company

Access to resources Recommend Favorite

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

By de Klerk E.  

Annals of Mathematics and Artificial Intelligence, Vol. 37, Iss. 3, 2003-03 ,pp. : 285-305

Springer Publishing Company

Access to resources Recommend Favorite

Integer programming, Barvinok's counting algorithm and Gomory relaxations

By Lasserre J.B.  

Operations Research Letters, Vol. 32, Iss. 2, 2004-03 ,pp. : 133-137

Elsevier

Access to resources Recommend Favorite

Parametric Disjunctive Programming: One-Sided Differentiability of the Value Function

By Gugat M.  

Journal of Optimization Theory and Applications, Vol. 92, Iss. 2, 1997-02 ,pp. : 285-310

Springer Publishing Company

Access to resources Recommend Favorite