Enriching Solutions to Combinatorial Problems via Solution Engineering.
Thierry PetitAndrew C. TrappPublished in: INFORMS J. Comput. (2019)
Keyphrases
- combinatorial problems
- constraint programming
- metaheuristic
- constraint satisfaction problems
- graph coloring
- constraint satisfaction
- traveling salesman problem
- combinatorial optimization
- solving hard
- optimal solution
- branch and bound algorithm
- phase transition
- graph colouring
- combinatorial search
- solution space
- global constraints
- specific problems
- hard combinatorial optimization problems
- solution quality
- constraint propagation
- integer programming
- constraint solver
- sat encodings
- exact solution
- neural network
- search strategy
- np hard
- lower bound
- computational complexity
- reinforcement learning