Centrum Wiskunde & Informatica: SIAM Journal on Optimization

Cones of matrices and set-functions and $0$-$1$ optimization Article

SIAM Journal on Optimization, 1(2), 166-190.

L. Lovász (László) and A. Schrijver (Lex)

January 1991

Tighter linear and semidefinite relaxations for max-cut based on the Lov\'asz-Schrijver lift-and-project procedure. Article

SIAM Journal on Optimization, 12(2), 345-375.

M. Laurent (Monique)

January 2001

Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure Article

SIAM Journal on Optimization, 345-375.

M. Laurent (Monique)

February 2001

Semidefinite approximations for global unconstrained polynomial optimization Article

SIAM Journal on Optimization, 16(2), 490-514.

D. Jibetean (Dorina) and M. Laurent (Monique)

January 2005

New reduction techniques for the group steiner tree problem Article

SIAM Journal on Optimization, 1176-1188.

C.E. Ferreira and F.M. de Oliveira Filho (Fernando Mario)

January 2006

New reduction techniques for the group Steiner tree problem Article

SIAM Journal on Optimization, 17(4), 1176-1188.

F.M. de Oliveira Filho (Fernando Mario) and C.E. Ferreira

January 2007

Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization Article

SIAM Journal on Optimization, 19(02), 592-615.

N. Gvozdenovic (Nebojsa) and M. Laurent (Monique)

July 2008

The operator $\Psi$ for the Chromatic Number of a Graph Article

SIAM Journal on Optimization, 19(02), 572-591.

N. Gvozdenovic (Nebojsa) and M. Laurent (Monique)

July 2008

SIAM Journal on Optimization

Collection

Collection

Published by S.I.A.M.

Cones of matrices and set-functions and $0$-$1$ optimization Article

Tighter linear and semidefinite relaxations for max-cut based on the Lov\'asz-Schrijver lift-and-project procedure. Article

Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure Article

Semidefinite approximations for global unconstrained polynomial optimization Article

New reduction techniques for the group steiner tree problem Article

New reduction techniques for the group Steiner tree problem Article

Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization Article

The operator $\Psi$ for the Chromatic Number of a Graph Article

Address

CWI researchers

Questions or comments?

SIAM Journal on Optimization

Collection

Collection

Published by S.I.A.M.

Cones of matrices and set-functions and $0$-$1$ optimization Article

Tighter linear and semidefinite relaxations for max-cut based on the Lov\'asz-Schrijver lift-and-project procedure. Article

Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure Article

Semidefinite approximations for global unconstrained polynomial optimization Article

New reduction techniques for the group steiner tree problem Article

New reduction techniques for the group Steiner tree problem Article

Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization Article

The operator $\Psi$ for the Chromatic Number of a Graph Article

Workflow

Workflow

Add Content