1142 search results - page 58 / 229 » Approximability of Clausal Constraints |
157
click to vote
ENDM
2010
15 years 3 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
189
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
164
click to vote
CHI
2005
ACM
16 years 6 months ago
2005
ACM
We introduce approximate query techniques for searching and analyzing two-dimensional data sets such as line or scatter plots. Our techniques allow users to explore a dataset by d...
245
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
153
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...