Improved Exact Algorithms for Mildly Sparse Instances of Max SAT.
Takayuki SakaiKazuhisa SetoSuguru TamakiJunichi TeruyamaPublished in: IPEC (2015)
Keyphrases
- exact algorithms
- max sat
- weighted max sat
- maximum satisfiability
- stochastic local search
- max sat solver
- sat solvers
- lower bound
- propositional satisfiability
- random sat instances
- search algorithm
- branch and bound algorithm
- tabu search
- sat problem
- vehicle routing problem with time windows
- satisfiability problem
- branch and bound
- randomly generated
- exact methods
- sat instances
- constraint satisfaction
- linear programming
- knapsack problem
- combinatorial optimization
- boolean formula
- boolean satisfiability
- phase transition
- approximation algorithms
- combinatorial problems
- exact solution
- neural network
- cnf formula
- constraint satisfaction problems
- simulated annealing
- information retrieval