Computing NP-Hard Repetitiveness Measures via MAX-SAT.
Hideo BannaiKeisuke GotoMasakazu IshihataShunsuke KandaDominik KöpplTakaaki NishimotoPublished in: ESA (2022)
Keyphrases
- max sat
- np hard
- branch and bound algorithm
- lower bound
- weighted max sat
- linear programming
- branch and bound
- satisfiability problem
- tabu search
- optimal solution
- sat solvers
- search algorithm
- np complete
- special case
- upper bound
- integer programming
- scheduling problem
- constraint satisfaction
- stochastic local search
- maximum satisfiability
- approximation algorithms
- computational complexity
- variable ordering
- max sat solver
- sat problem
- cnf formula
- constraint satisfaction problems
- search tree
- heuristic search