text: Starting from a DP-based solution to the traveling salesman problem , we present a novel [[ technique ]] to restrict the possible word reordering between source and target language in order to achieve an efficient << search algorithm >> .