427 search results - page 5 / 86 » A Subexponential Bound for Linear Programming |
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
STACS
2010
Springer
14 years 2 months ago
2010
Springer
SIAMJO
2002
13 years 7 months ago
2002
We consider the interior-point approach to sensitivity analysis in linear programming developed by the authors. We investigate the quality of the interior-point bounds under degene...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...