41 search results - page 1 / 9 » On Using Cutting Planes in Pseudo-Boolean Optimization |
JSAT
2006
13 years 4 months ago
2006
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
DATE
2008
IEEE
13 years 6 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
ICCV
2009
IEEE
14 years 8 months ago
2009
IEEE
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
SIAMJO
2010
12 years 11 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...