Solving Combinatorial Problems via the Random Exploration of the Search Space: An Experimental Approach for Fast Decision Making.
Cristiano M. SilvaFernanda S. H. SumikaDaniel Ludovico GuidoniLeonardo Alvarenga L. SantosJoão Fernando Machry SarubbiSomayeh MokhtariMatheus F. Rodrigues SantosJosé Marcos Silva NogueiraPublished in: NOMS (2022)
Keyphrases
- combinatorial problems
- combinatorial search
- search space
- metaheuristic
- combinatorial optimization
- solving hard
- decision making
- constraint satisfaction problems
- graph coloring
- constraint programming
- pseudo boolean
- traveling salesman problem
- constraint satisfaction
- constraint solvers
- branch and bound
- phase transition
- sat encodings
- hard combinatorial optimization problems
- branch and bound algorithm
- search problems
- search algorithm
- search strategies
- ant colony optimization
- simulated annealing
- randomly generated
- specific problems
- finite domain
- heuristic search
- optimization problems
- constraint propagation
- global constraints
- sat solvers
- search strategy
- tabu search
- graph colouring
- search tree
- search methods