Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

115

CORR
2010
Springer

favoriteEmaildiscussreport

142views Education» more CORR 2010»

Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack

15 years 10 days ago

Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack

Download www.cs.washington.edu

Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov

Anna R. Karlin, Claire Mathieu, C. Thach Nguyen

Real-time Traffic

CORR 2010 | Education | Fully Polynomial Time Approximation Scheme | Integrality Gap | Optimization Problems |

claim paper

Related Content

» Constant factor approximation algorithm for the knapsack median problem

» Proving Integrality Gaps without Knowing the Linear Program

» Tight integrality gaps for LovaszSchrijver LP relaxations of vertex cover and max cut

» LiftandProject Integrality Gaps for the Traveling Salesperson Problem

» A Linear Round Lower Bound for LovaszSchrijver SDP Relaxations of Vertex Cover

» Truthful and NearOptimal Mechanism Design via Linear Programming

» Multicommodity Demand Flow in a Tree

» On linear and semidefinite programming relaxations for hypergraph matching

» Sheraliadams relaxations of the matching polytope

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Anna R. Karlin, Claire Mathieu, C. Thach Nguyen

Comments (0)