Standard cell routing via boolean satisfiability.

Nikolai Ryzhenko Steven M. Burns

Published in: DAC (2012)

Keyphrases

boolean satisfiability
sat solving
sat solvers
sat problem
boolean optimization
integer linear programming
symmetry breaking
objective function
domain independent
branch and bound algorithm
randomly generated
sat instances
probabilistic planning
random sat instances