Improved exact algorithms for mildly sparse instances of Max SAT.
Takayuki SakaiKazuhisa SetoSuguru TamakiJunichi TeruyamaPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- exact algorithms
- max sat
- maximum satisfiability
- weighted max sat
- stochastic local search
- max sat solver
- lower bound
- branch and bound algorithm
- sat solvers
- vehicle routing problem with time windows
- propositional satisfiability
- search algorithm
- random sat instances
- branch and bound
- satisfiability problem
- sat problem
- tabu search
- randomly generated
- constraint satisfaction
- exact methods
- linear programming
- sat instances
- boolean satisfiability
- knapsack problem
- cnf formula
- objective function
- computational complexity
- approximation algorithms
- np complete
- genetic algorithm
- combinatorial optimization
- phase transition
- heuristic methods
- search strategies
- exact solution