Branch Location Problems with Maximum Satisfiability.
Oleg ZaikinAlexey IgnatievJoão Marques-SilvaPublished in: ECAI (2020)
Keyphrases
- location problems
- maximum satisfiability
- boolean satisfiability
- max sat
- single facility
- bicriteria
- combinatorial problems
- sat problem
- integer linear programming
- sat solvers
- branch and bound
- randomly generated
- satisfiability problem
- branch and bound algorithm
- constraint programming
- lower bound
- learning algorithm
- markov decision processes
- probabilistic planning
- constraint satisfaction problems
- optimal solution