Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
Start Free
Train ML Models With SQL You Already Know
BigQuery automates data prep, analysis, and predictions with built-in AI assistance.
Build and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
Le TSP est une application resolvant le problème du voyageur du commerce.
baser sur le TSP de saiko il a été modifier et améliorer afin de simplifier son utilisation et sa compréhension
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
A heuristic implementation for solving the Bottleneck Traveling Salesman Problem (BTSP) and related problems, such as the Maximum Scatter Traveling Salesman Problem (MSTSP).
A robust Genetic Algorithms Java Framework, whichs supports individuals exchange between islands through JMX. Including demos to solve the SAT and TSP problems.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
The Minor Java Algebra Library aims to become an open, standard Java library for common problems in the domain of algebra and selected optimisation problems such as TSP and others. MiJAL is aimed to be used in educational envirements but not limited to.
evoltsp is a GPL Java-Framework to solve Travelling Salesmen Problems
using Evolutionary Strategies. Features a small example of how to optimize a 127-location TSP problem, pluggable Strategy Classes
that contain trivial & more elaborated TSP solvers
AgCSP is a CSP solver which use Evolutionary methodes. It is composed of a extendable library, parrallele executable and graphical interface. The CSP can be graph coloring, TSP, or anything else.