<--- Back to Details
First PageDocument Content
Operations research / Combinatorial optimization / Mathematical optimization / NP-complete problems / Linear programming / Cut / Semidefinite programming / Approximation algorithm / Maximum cut / Theoretical computer science / Mathematics / Applied mathematics
Date: 2011-04-22 21:00:29
Operations research
Combinatorial optimization
Mathematical optimization
NP-complete problems
Linear programming
Cut
Semidefinite programming
Approximation algorithm
Maximum cut
Theoretical computer science
Mathematics
Applied mathematics

Add to Reading List

Source URL: www.ic.unicamp.br

Download Document from Source Website

File Size: 732,64 KB

Share Document on Facebook

Similar Documents

Preprints of the 16th IFAC Symposium on System Identification The International Federation of Automatic Control Brussels, Belgium. July 11-13, 2012 Identification of a Wiener System via Semidefinite Programming

DocID: 1vrYF - View Document

Semidefinite Programming Duality Implications for System Theory and Computation Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 6 July, 2004

DocID: 1vqgc - View Document

ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

DocID: 1vq1m - View Document

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming∗ Xin-Yuan Zhao †

DocID: 1vnwF - View Document

COMPARISON BETWEEN AN INFEASIBLE INTERIOR POINT ALGORITHM AND A HOMOGENEOUS SELF DUAL ALGORITHM FOR SEMIDEFINITE PROGRAMMING by

DocID: 1uVxH - View Document