Exploiting subproblem optimization in SAT-based MaxSAT algorithms.
Carlos AnsóteguiJoel GabàsJordi LevyPublished in: J. Heuristics (2016)
Keyphrases
- optimization problems
- combinatorial optimization
- optimization methods
- discrete optimization
- evolutionary algorithm
- computational cost
- data structure
- dynamic programming
- upper bound
- computational complexity
- sat solvers
- learning algorithm
- simulated annealing
- optimization algorithm
- orders of magnitude
- optimization method
- global optimization
- decision trees
- integer programming