270 search results - page 3 / 54 » Constraint relaxation in approximate linear programs |
ISSRE
2007
IEEE
13 years 9 months ago
2007
IEEE
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
CP
2010
Springer
13 years 6 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
JMLR
2010
13 years 2 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
CP
2005
Springer
14 years 27 days ago
2005
Springer
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...