Search Results for "open solver"

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.

Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming. ● LiPS gives sensitivity analysis procedures, which allow us to...

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.

This is an intelligent Sudoku solver in c++. It is intlligent, because it uses several logical deduction methods, just like a person, before resorting to guessing. I was trying to teach my kids Sudoku, and taught a computer as proof of concept.

This project an efficient method of solving a scrabble board.

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.

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.

Given a placement of pieces on a chessboard, find the move which forces checkmate as rapidly as possible.

malkriz is solver for griddlers (japanese puzzle) written as simple portable classes in c++. You'll find here complete programs using it, written for MSVC6, Qt and cgi. Web version (in slovak language): http://frix.fri.utc.sk/~johny/mkfrm.php

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

A high-performance C++ Sudoku solver implementing Knuth's Dancing Links (DLX) algorithm — one of the fastest exact cover algorithms in the world.