Search Results for "open solver" - Page 2
Sort By:
Showing 71 open source projects for "open solver"
View related business solutions-
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
DisChoco
DisChoco: Distributed Constraint Reasoning Solver
DisChoco is a Distributed Constraint Reasoning Solver. Several Distributed Constraint Reasoning algorithms are implemented (like ABT, AFC, Adopt, ...). Users may easily implement and test their algorithms with DisChoco. contact: wahbi[at]users[dot]sourceforge[dot]net -
2
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance,... -
3
Sudokut is a platform-independent Sudoku Solver written in Tcl. It is a command line tool, with no graphic interface: just pass a sudoku problem as a string to the command and it returns all possible solutions. It also explains the entire resolution process.
-
4
Linear Program Solver
Solve linear programming problems
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... -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
5
EasyCP
The easiest C++ way to deal with constraints !
EasyCP is a modern, user-friendly C++ library that lets you use constraint programming in a very natural way, taking advantage of its expressive power. Just model and let the CSP (Constraint Satisfaction Problem) solver do the job ! -
6
Dantzig-Wolfe Solver
An implementation of Dantzig-Wolfe decomposition built upon GLPK
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). -
7
* Model-checking/simulation-checking library for real-time system with dense-time models in C with CRD (Clock-Restriction Diagrams) technology. * Parametric analysis library for linear-hybrid systems in C with HRD (Hybrid-Restriction Diagram) technol
-
8
sudoku Solver
A sudoku solver project built with Java with a user friendly interface
This project has been built to allow you solve any Sudoku problem in no time. The project built using Java programming language. It`s simple interface built using Swing technology. A smart algorithm has been designed to solve your problem. First, using the systematic human way of solving. If the human failed to solve, your problem will be passed to a stronger algorithm that based on Try and Fail techniques and possibilities. Enjoy, learn and develop. You need to install Java JRE to run the... -
9
cuLsoda is an implementation of the Livermore Solver for Ordinary Differential Equations with Automatic switching for stiff and non-stiff problems (LSODA), written in NVIDIA's C for CUDA GPGPU API. NOTE: This repository is now deprecated and replaced by a new one at GitHub: https://github.com/Celemourn/cuLsoda
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
10
Zero Sum Game Solver JavaScript Library
Zero Sum Game Solver JavaScript Library
Zero Sum Game Solver JavaScript Library -
11
Conflicts
Automatic Solver for Railway-related conflicts
Automatic Solver for Railway-related conflicts -
12
scd_EUgran
EUgran solver for OpenFoam with new Boundary Conditions.
In the spirit of open source software, feel free to use the code for the boundary conditions. We have tested it last year for the simulation of fluidized beds. It is an extension of the standard twoPhaseEulerFoam. It includes J&J BC's and the newer BC's for the solid phase of Schneiderbauer et. al., which are a modification of the work of Jenkins and decide between sliding and non-sliding particle-wall collisions. Additionally the computation of the solids pressure is changed to the newest... -
13
This program is used to create and solve queueing network models using Mean Value Analysis using a GUI front end and the WX widget library.
-
14
Simplex Solver For PHP
PHP class library for simplex method
Resolve standard Maximization / Minimization problem in LP using Simplex Method. *Currently support maximization only. -
15
Zero Sum Game Solver Java Library
Zero Sum Game Solver Java 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. -
16
A static checker that model checks the implementation of equality for an Eclipse Java Project.
-
17
WinMumps
Visual Studio project and solution files for building MUMPS
Visual Studio project and solution files for building the MUltifrontal Massively Parallel Solver (http://graal.ens-lyon.fr/MUMPS/). WinMumps is a vc[x]proj/vfproj python based generator that allows to build Mumps (version 4.10.x) and its external dependencies (such as ptscotch, parmetis, pord) using the Microsoft C compiler and the Intel Fortran compiler. Templates for msvc10 (Visual Studio 2010), msvc8 (Visual Studio 2005), Intel Visual Fortran Compiler and Intel Composer-XE are available. -- How-to -- A) you need: 1/ the downloaded archive from Sourceforge 2/ python-2.6.x (this python script is not compatible with python 3.x) 3/ Visual Studio 2010 (or 2005) 4/ Intel XE Composer ( or Visual Fortran) 5/ Mpich2, scotch/ptscotch, metis/parmetis (optional) B)procedure: 1/ unzip the downloaded archive of WinMumps 2/ execute "python winmumps_generator.py" providing the options needed 3/ open the solution file written (using Visual Studio) and build the solution -
18
-
19
-
20
Genetic Algorithm General Solver-GAGENES
Genetic algorithms (GA) in C++
NOTE: Project has been delayed due to other tasks. Genetic Algorithms General Solver (GAGENES) is a C++ implementation of the genetic algorithm concept. -
21
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.
-
22
The SBML ODE Solver is a command-line tool and programming library (ISO/ANSI C) for construction and numerical integration of an ODE system, derived from an SBML based description of a biochemical reaction network. Development has moved to https://github.com/raim/SBML_odeSolver . Please download the latest version from there!
-
23
A simple command line tool for solving the triangular peg solitaire game, like the one at Cracker Barrel. Also has a few other features.
-
24
Our goal is to develop a full working solver for ATA (with 1 clock) in Python, with MTL to ATA support. The decidability for the emptiness problem was proposed by Lasota and Walukiewicz. The MTL to ATA was proposed by Ouaknine and Worrell.
-
25
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.