Lightweight Traveling Campers

GPassword Manager is a simple, lightweight and very powerful utility for managing passwords. Designed with flexibility and overall utility as a goal. Developed cross-platform with the Qt application framework and Crypto++ for file encryption Here are some key features of "GPassword Manager":...

Radical is a light-weight Java RAD tool for WYSIWYG GUI creation and source code generation. The purpose of Radical is to not compete with existing IDEs that offer such tools, rather its purpose is to provide a simpler, lightweight alternative.

The user has to supply the fixed ending points before the script can be ran. Requirements: - MATLAB 7.6 or higher


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

It finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations). Each salesman travels to...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

Finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities without returning to the starting location).Each salesman starts at the...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

The script finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities and finally to the end location).Each salesman starts at the...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to individual cities and back to the original starting place).Each salesman starts at the first point, and...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

This method produces different results depending on what city is choosen as the starting point.This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes. Requirements: - MATLAB 7.6 or higher


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point. Requirements: - MATLAB 7.6 or higher


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

FlameRobin is a lightweight and cross-platform administration and management GUI for the Firebird DBMS.Features:- lightweight (small footprint, fast execution)- cross-platform (Linux, Windows, Mac OS X, FreeBSD, Solaris)- dependent only on other Open Source software


Platforms: C and C plus plus

Tablecloth is lightweight, easy to use, unobtrusive way to add style and behaviour to your html table elements.By simply adding 2 lines of code to your html page you will have styled and active tables that your visitors will love.Tablecloth is meant for proper usage of tables only. Used on...


Platforms: JavaScript

CLEditor is an open source jQuery plugin which provides a lightweight, full featured, cross browser, extensible, WYSIWYG HTML editor that can be easily added into any web site.


Platforms: JavaScript

Simulated Annealing Optimization m-file The program set can be used to solve TRAVELING SALESMAN PROBLEMSfrom the TSPLIB.


Platforms: Matlab

The user is presented with the near-optimal solution and performance chart in a dialog window.


Platforms: Matlab

The user has to supply the fixed ending points before the script can be ran.


Platforms: Matlab

It finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations).Each salesman travels to...


Platforms: Matlab

Finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities without returning to the starting location).Each salesman starts at the...


Platforms: Matlab

The script finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities and finally to the end location).Each salesman starts at the...


Platforms: Matlab

The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point.


Platforms: Matlab

The script can display how the route rearranges at each script iteration.The input for the program is an Nx2 cities array sorted in the initial traveling path.The output is the cities arranged in a more effective route, index vector of the order the cities should be visited & the total rout length.


Platforms: Matlab