2976 search results - page 128 / 596 » On the bounded integer programming |
103
Voted
COCO
2007
Springer
15 years 6 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...
100
click to vote
ISCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
122
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
105
Voted
TCS
2008
15 years 16 days ago
2008
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
100
click to vote
SIAMCOMP
2000
15 years 12 days ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...