A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances.

Magnus Wahlström

Published in: IWPEC (2008)

Keyphrases

upper bound
sat instances
lower bound
satisfiability problem
sat solvers
optimal solution
randomly generated
sat problem
genetic algorithm
branch and bound algorithm
random instances
total weight