Search Results for "open tax solver"

Mixed Integer Linear Programming (MILP) solver lp_solve solves pure linear, (mixed) integer/binary, semi-cont and special ordered sets (SOS) models.lp_solve is written in ANSI C and can be compiled on many different platforms like Linux and WINDOWS

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...

ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects.

Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.

..., the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large)

An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link).

Zero Sum Game Solver JavaScript Library

Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.

NOTE: Project has been delayed due to other tasks. Genetic Algorithms General Solver (GAGENES) is a C++ implementation of the genetic algorithm concept.

A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.

Kuhn-Munkres is used inside assignment problem solver application. Instance generator application creates input file for the solver. Checker application verifies the solution computed by the solver. A bash script compiles, executes these apps.

This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.

Crazy Turtle puzzle game solver utility. Other names: CRAZY TURTLE / LE JEU FOU DE LA TORTUE / NAUGHTY TURTLES / ŠAŠAVE KORNJAČE / NAGAJIVE ŽELVICE / SASAVE KORNJACE

Matho is a OS Independant Application and API for mathematical operations, features include curve sketching, calculus, iterative formulae, algebra solver, 2d/3d geometry and mechanical and statistical functionality.

A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.

A Constraint Programming engine with many examples (planning, sudoku solver...)

YACS (Yet Another Constraint Solver) is a Java library and an object-oriented framework for constraint solvers. It supports propagating and solving of constraint satisfaction problems with finite and infinite domains (discrete values and real intervals).