The traveling salesman problem on grids with forbidden neighborhoods
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-017-0119-z
Abstract: We introduce the traveling salesman problem with forbidden neighborhoods (TSPFN). This is an extension of the Euclidean TSP in the plane where direct connections between points that are too close are forbidden. The TSPFN is… read more here.
Keywords: salesman problem; forbidden neighborhoods; problem grids; traveling salesman ... See more keywords