Semidefinite programming and integer programming
Monique Laurent (moniquecwi.nl)
Abstract: We survey how semidefinite programming can be used for finding good approximative solutions to hard combinatorial optimization problems.
Keywords: combinatorial optimization, linear programming, semidefinite programming, approximative algorithm
Category 1: Integer Programming (0-1 Programming )
Category 2: Combinatorial Optimization
Category 3: Linear, Cone and Semidefinite Programming (Semi-definite Programming )
Citation: Preliminary version appeared as Report PNA-R0210, CWI, Amsterdam, April 2002. To appear as Chapter in the Handbook on Discrete Optimization, K. Aardal, G. Nemhauser, R. Weismantel, eds., Elsevier Publishers.
Entry Submitted: 12/19/2002
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|