Top 5 alternative sites to andre-rohe.de
JAVA combinatorial optimization
Combinatorial Optimization;Traveling Salesman Problem;TSP
TSPSG | TSP Solver and Generator
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving.
Driving Route Planner - Driving distance optimizer
This site solves the "Travelling Salesman" problem by calculating the shortest and/or quickest route that traverses up to 25 different addresses.
ZIP-Methode: neuer kombinatorischer Lösungsansatz für TSP (Traveling-Salesman-Problem)
Quantensprung bei optimalem Traveling-Salesman-Problem (TSP) bzw. Rundreiseproblem: Können bekannte Lösungen nicht nur auf Graphen (Rundreisen) sondern auch auf Teilgraphen angewandt werden, so bringt die ZIP-Methode den entscheidenden Quantensprung der rechentechnischen Vereinfachung.
Author: Jochen Pleines
Driving Route Optimizer - Driving distance optimizer
Driving Route Optimizer saves you time and money by optimizing complex driving routes involving up to 23 different addresses. Often referred to as the 'Travelling Salesman Problem', our logistics algorithms find the quickest route for you.