A Quantum Annealing Approach for Solving Hard Variants of the Stable Marriage Problem.
Christoph RochDavid WinderlClaudia Linnhoff-PopienSebastian FeldPublished in: I4CS (2022)
Keyphrases
- solving hard
- stable marriage
- combinatorial problems
- partial order
- satisfiability problem
- search problems
- related problems
- propositional logic
- stochastic local search
- soft constraints
- propositional satisfiability
- sat problem
- constraint satisfaction problems
- simulated annealing
- constraint satisfaction
- constraint programming
- phase transition
- metaheuristic
- search algorithm
- heuristic search
- sat solvers
- temporal logic
- combinatorial optimization
- global constraints
- arc consistency
- branch and bound algorithm
- search strategies
- sat instances
- orders of magnitude
- traveling salesman problem
- symmetry breaking
- multi objective