Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later.
rjudge is a judge system for the Olympiad in Informatics. It can be also used as a problem test tool in the programming contest and daily practice. It provides many security features to ensure the smooth implement of judgement.
VL-1 is High Performance Computing Middleware designed for the domain experts/researchers/Teachers who want to focus more on their problem then finding out ways of how to implement their problem.
Auto-discovery finds your devices and deploys pre-configured sensors instantly. No project plan required, just visibility from day one.
Waiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.