MaxSAT-Based Bi-Objective Boolean Optimization.
Christoph JabsJeremias BergAndreas NiskanenMatti JärvisaloPublished in: SAT (2022)
Keyphrases
- bi objective
- boolean optimization
- boolean satisfiability
- efficient solutions
- multi objective
- sat solvers
- sat solving
- multi objective optimization
- branch and bound algorithm
- multiple objectives
- ant colony optimization
- sat problem
- network design
- integer linear programming
- probabilistic planning
- combinatorial problems
- symmetry breaking
- optimal solution
- randomly generated
- pseudo boolean
- shortest path problem
- neural network
- knapsack problem
- routing problem
- lower bound
- orders of magnitude
- constraint satisfaction problems
- search space
- evolutionary algorithm
- boolean formula
- scheduling problem
- upper bound
- search tree
- optimization algorithm
- constraint satisfaction
- constraint programming
- nsga ii