Search Results for "step"

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. The result can be printed or saved as PDF...

Ani3D provides portable libraries for each step in the numerical solution of systems of PDEs with variable tensorial coefficients: (1) unstructured adaptive mesh generation, (2) metric-based mesh adaptation, (3) finite element discretization and interpolation, (4) algebraic solvers.

"chinese remainder" solves a system of equations over modulus quickly. crtwo is an improvement to Mathematica's release. crtwo: solves Chinese Remainder a pair at a time, (uses gcd), yet is still fast. Which means crtwo, unlike text book soln, uses an algorithm to solve or fail one mod equation at a time. showing win or fail of each eqn and solving other sawtooth intersections is possible, due to that. crAll2@crtwo provides n soln near x for CR using width of soln crchart3...

Simplex-in-PHP are PHP scripts that solve small linear programming and integer linear programming problems executing the simplex method step by step, printing the tableau and drawing the graphical analysis. Useful for students in Operational Research

Adaptive Wavelet Applications on general domains - the goal still far away. But the first step is done. This project aims at introducing wavelet methods realized in C++. As building block it uses FLENS.

G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.

A tool for proof theorists to study deduction systems and to develop proof search strategies for them. GraPE should eventually support step-by-step proof construction, automatic proof search with various strategies, proof transformations and analysis.