Combinatorial optimization

[Lemaréchal and Oustry, 1999]
 
Show BibTeX entryVisit the webpage of the paper
C. Lemaréchal and F. Oustry (1999).
Semi-definite relaxations and Lagrangian duality with application to combinatorial optimization.
Rapport de Recherche Nr. 3710. Inria. \tt http_//www.inria.fr/rrrt/rr-3710.html.
[Lemaréchal and Oustry, 2001]
 
Show BibTeX entry
C. Lemaréchal and F. Oustry (2001).
SDP relaxations in combinatorial optimization from a Lagrangian point of view.
In: N. Hadjisavvas and P. M. Pardalos (eds.), Advances in Convex Analysis and Global Optimization. pp. 119--134. Kluwer.