.png){kind=icon}
.png){kind=icon}
Return
Approximations and randomization to boost CSP techniques
.png){kind=icon}
PRE
AI
DOI：10.1023/B:ANOR.0000032572.32788.da.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years we have seen an increasing interest in combining constraint satisfaction problem ( CSP) formulations and linear programming ( LP) based techniques for solving hard computational problems. While considerable progress has been made in the integration of these techniques for solving problems that exhibit a mixture of linear and combinatorial constraints, it has been surprisingly difficult to successfully integrate LP- based and CSP- based methods in a purely combinatorial setting. Our approach draws on recent results on approximation algorithms based on LP relaxations and randomized rounding techniques, with theoretical guarantees, as well on results that provide evidence that the runtime distributions of combinatorial search methods are often heavy- tailed. We propose a complete randomized backtrack search method for combinatorial problems that tightly couples CSP propagation techniques with randomized LP- based approximations. We present experimental results that show that our hybrid CSP/ LP backtrack search method outperforms the pure CSP and pure LP strategies on instances of a hard combinatorial problem.
Keywords:
SATISFIABILITY
SEARCH
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
No organization information available