Improving the Efficiency of Euclidean TSP Solving in Constraint Programming by Predicting Effective Nocrossing Constraints.
Elena BellodiAlessandro BertagnonMarco GavanelliRiccardo ZesePublished in: AI*IA (2020)
Keyphrases
- constraint programming
- finite domain
- combinatorial problems
- constraint problems
- search heuristics
- constraint propagation
- constraint optimization
- constraint satisfaction problems
- global constraints
- constraint satisfaction
- constraint solvers
- combinatorial optimization
- constraint solver
- integer programming
- search strategies
- constraint networks
- constraint solving
- constraint logic programming
- traveling salesman problem
- hard and soft constraints
- np hard problems
- column generation
- symmetry breaking
- machine learning or data mining
- itemset mining
- graph coloring
- highly efficient
- ant colony optimization
- np complete
- arc consistency
- np hard
- special case