Resultados globales: 2 registros encontrados en 0.02 segundos.
Artículos, Encontrados 2 registros
Artículos Encontrados 2 registros  
1.
29 p, 1.7 MB Cuts, matrix completions and graph rigidity / Laurent, Monique
This paper brings together several topics arising in distinct areas: polyhedral combinatorics, in particular, cut and metric polyhedra; matrix theory and semidefinite programming, in particular, completion problems for positive semidefinite matrices and Euclidean distance matrices; distance geometry and structural topology, in particular, graph realization and rigidity problems. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 255-283  
 Acceso restringido a la UAB
2.
22 p, 939.0 KB Connections between semidefinite relaxations of the max-cut and stable set problems / Laurent, Monique ; Poljak, Svatopluk ; Rendl, Franz
We describe links between a recently introduced semidefinite relaxation for the max-cut problem and the well known semidefinite relaxation for the stable set problem underlying the Lovász's theta function. [...]
1997
Mathematical Programming, vol. 77 n. 2 (1997) p. 225-246  
 Acceso restringido a la UAB

¿Le interesa recibir alertas sobre nuevos resultados de esta búsqueda?
Defina una alerta personal vía correo electrónico o subscríbase al canal RSS.