Computing NP-hard Repetitiveness Measures via MAX-SAT.
Hideo BannaiKeisuke GotoMasakazu IshihataShunsuke KandaDominik KöpplTakaaki NishimotoPublished in: CoRR (2022)
Keyphrases
- max sat
- np hard
- branch and bound algorithm
- lower bound
- weighted max sat
- linear programming
- sat solvers
- tabu search
- optimal solution
- search algorithm
- branch and bound
- np complete
- scheduling problem
- approximation algorithms
- satisfiability problem
- sat problem
- upper bound
- variable ordering
- unsatisfiable cores
- integer programming
- boolean satisfiability
- constraint satisfaction problems
- randomly generated
- propositional satisfiability
- computational complexity