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