Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems.
Miroslav N. VelevPing GaoPublished in: DATE (2008)
Keyphrases
- boolean satisfiability
- routing problem
- probabilistic planning
- sat solvers
- branch and bound algorithm
- randomly generated
- sat solving
- integer linear programming
- symmetry breaking
- sat problem
- vehicle routing problem
- phase transition
- combinatorial problems
- depth first search
- column generation
- max sat
- data structure
- orders of magnitude
- shortest path
- sat instances
- boolean functions
- routing algorithm
- lower bound