Abstract Satisfiability Modulo the Theory of Nonlinear Real Arithmetic, SMT(NRA) for short, concerns satisfiability polynomial formulas , which are quantifier-free Boolean combinations equations and inequalities with integer coefficients real variables. In this paper, we propose a local search algorithm special subclass SMT(NRA), where all constraints strict inequalities. An important fact is t...

The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...