Search Results for "tsp"

...Our flagships are the GraphHopper routing engine and jsprit, the toolkit for solving rich vehicle routing problems. We promote a fair & diverse mindset. jsprit is a Java based toolkit for solving rich traveling salesman problems (TSP) and vehicle routing problems (VRP). It is lightweight, flexible, easy-to-use, and based on a single all-purpose meta-heuristic. The GraphHopper routing engine is fast and memory-efficient, using Java. It runs server side, offline on Android and iOS. It uses OpenStreetMap data, but can import other data sources as well. GraphHopper is a fast and memory-efficient routing engine released under Apache License 2.0. ...

Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal...

What is QPF 2.6 ? QPF 2.6 (or Quantum Programming framework 2.6) is a free simple and easy to use framework dedicated to supporting programmers who are developing software for the D-wave one series of quantum computers.