Search Results for "optimization solver"
Sort By:
Showing 28 open source projects for "optimization solver"
View related business solutions-
HubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
-
With the world of work changed forever, it’s essential to manage your workplace and assets together to effectively create a high-performing environment. The Eptura experience combines the power of workplace management software with asset management, enabling you to effectively operate your building and facilitate hybrid work.
-
1
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others... -
2
DiffOpt.jl
Differentiating convex optimization programs w.r.t. program parameters
DiffOpt.jl is a package for differentiating convex optimization programs (JuMP.jl or MathOptInterface.jl models) with respect to program parameters. Note that this package does not contain any solver. This package has two major backends, available via the reverse_differentiate! and forward_differentiate! methods, to differentiate models (quadratic or conic) with optimal solutions. Differentiable optimization is a promising field of convex optimization and has many potential applications in game... -
3
EAGO.jl
A development environment for robust and global optimization
EAGO is an open-source development environment for robust and global optimization in Julia. EAGO is a deterministic global optimizer designed to address a wide variety of optimization problems, emphasizing nonlinear programs (NLPs), by propagating McCormick relaxations along the factorable structure of each expression in the NLP. Most operators supported by modern automatic differentiation (AD) packages (e.g., +, sin, cosh) are supported by EAGO and a number of utilities for sanitizing native... -
4
POT
Python Optimal Transport
This open source Python library provides several solvers for optimization problems related to Optimal Transport for signal, image processing and machine learning. -
Managing your therapy and rehab practice is a time-consuming process. You spend hours on paperwork, billing, scheduling, and more. Raintree’s Therapy & Rehab EHR is here to help you manage your practice more efficiently. With our all-in-one solution, you’ll get the tools you need to streamline your therapy and rehab practice, improve patient care, and get back to doing what you love.
-
5
ProxSDP.jl
Semidefinite programming optimization solver
ProxSDP is an open-source semidefinite programming (SDP) solver based on the paper "Exploiting Low-Rank Structure in Semidefinite Programming by Approximate Operator Splitting". The main advantage of ProxSDP over other state-of-the-art solvers is the ability to exploit the low-rank structure inherent to several SDP problems. -
6
Tulip.jl
Interior-point solver in pure Julia
Tulip is an open-source interior-point solver for linear optimization, written in pure Julia. It implements the homogeneous primal-dual interior-point algorithm with multiple centrality corrections and therefore handles unbounded and infeasible problems. Tulip’s main feature is that its algorithmic framework is disentangled from linear algebra implementations. This allows to seamless integration of specialized routines for structured problems. -
7
ParallelStencil.jl
Package for writing high-level code for parallel stencil computations
ParallelStencil empowers domain scientists to write architecture-agnostic high-level code for parallel high-performance stencil computations on GPUs and CPUs. Performance similar to CUDA C / HIP can be achieved, which is typically a large improvement over the performance reached when using only CUDA.jl or AMDGPU.jl GPU Array programming. For example, a 2-D shallow ice solver presented at JuliaCon 2020 [1] achieved a nearly 20 times better performance than a corresponding GPU Array programming... -
8
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
GeneticSharp is a fast, extensible, multi-platform and multithreading C# Genetic Algorithm library that simplifies the development of applications using Genetic Algorithms (GAs). Can be used in any kind of .NET 6, .NET Standard and .NET Framework apps, like ASP .NET MVC, ASP .NET Core, Blazor, Web Forms, UWP, Windows Forms, GTK#, Xamarin, MAUI and Unity3D games. GeneticSharp and extensions (TSP, AutoConfig, Bitmap equality, Equality equation, Equation solver, Function builder, etc). A Blazor... -
9
-
Exact Payments delivers easy-to-integrate embedded payment solutions enabling you to rapidly onboard merchants, instantly activate a variety of payment methods and accelerate your revenue — delivering an end-to-end payment processing platform for SaaS businesses.
-
10
ECLiPSe CLP
ECLiPSe Constraint Logic Programming System
The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques. -
11
AntTSP
Traveling Salesman Problem (TSP) Solver
Fast Ant Colony Optimization TSP Solver -
12
Qbsolv
A decomposing solver
Qbsolv,a decomposing solver, finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces solved either via a D-Wave system or a classical tabu solver. (Note that qbsolv by default uses its internal classical solver. Access to a D-Wave system must be arranged separately.) -
13
SMASH
Massively parallel software for quantum chemistry calculations
Scalable Molecular Analysis Solver for High-performance computing systems (SMASH) is massively parallel software for quantum chemistry calculations and released under the Apache 2.0 open source license. It is currently capable of energy, analytical gradient, and geometry optimization calculations of Hartree-Fock theory and Density Functional Theory (DFT), and energy calculations of Second-order Moller-Plesset (MP2) perturbation theory. DFT calculations can be performed on 100,000 CPU cores... -
14
An open source Solver-compatible optimization engine for Microsoft Excel on Windows and Mac using the Coin-OR CBC linear and integer programming optimizer. You can also use other solvers like Gurobi (if you have it installed), solvers on the NEOS cloud, and various non-linear solvers are supported too.
-
15
OpenOCL Matlab
Optimal control, trajectory optimization, model-predictive control.
The Open Optimal Control Library is a software framework in Matlab/Octave for modeling optimal control problem. It uses automatic differentiation and fast non-linear programming solvers. It implements direct methods. In the backend it uses CasADi and ipopt. -
16
Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are: · Solvexo solver is based on the efficient implementation of the simplex method (one or two phases); · Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming. · Solvexo provides a solution with the graphic method for problems with tow...
-
17
SoDiOpt
A numerical solver for optimization-constrained differential equations
SoDiOpt is a MATLAB-based code that performs numerical integration of Optimization-Constrained Differential Equations (OCDE). SoDiOpt provides efficient numerical solution of OCDE by using the optimality-based solution method. A sequence of DAE systems are generated and classical index-1 DAE simulator is applied to solve the derived DAE systems. -
18
jalicanto
Traveling Salesman Problem "window time based" aproximate solver
Time based Traveling salesman problem solver. Using iterated local search algorithm, implements xkick perturbation Programmed in Java. A class to use the TSP Suite(Thomas Weise, Raymond Chiong, J ¨org L¨assig, Ke Tang, Shigeyoshi Tsutsui, Wenxiang Chen, Zbigniew Michalewicz, Xin Yao, Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem. 2014.),is implemented. -
19
Grammar based Combinatorial Solver
Solver with Applications in Computer Network Systems Design
The solver performs an exhaustive search on the space defined using simple formal language grammar constructs to identify solutions that meet the objective and constraints. It can be used to easily define complex discrete multi-dimensional combinatorial problems that are otherwise difficult to model using Mixed Integer Linear Programming solvers. The solver does not make any assumptions on continuity of the search space. The solver is implemented in PHP. A GoJS based visualization is provided... -
20
ICE (Interval Calculator for Engineer)
Interval Calculator for Engineer
ICE is a simple mathematical calculator with very useful shortcuts for Engineer: works natively with tolerance, can run Monte Carlo analysis, uses engineer notation, includes most of the day by day functions used by engineers. -
21
Crevice
Modeling environment for linear and nonlinear optimization
Crevice provides a modeling environment for linear and nonlinear optimization and bindings for solver libraries. Binaries for 32 and 64bit Windows as well as makefiles for Linux are available. -
22
ViennaCL
Linear algebra and solver library using CUDA, OpenCL, and OpenMP
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. -
23
Pannon Optimizer
A simplex-based large-scale linear programming solver.
The Pannon Optimizer is an open-source simplex-based linear programming solver. It is designed for research purposes and is able to solve large-scale linear optimization problems. The Pannon Optimizer is still under development, currently in ALPHA version. -
24
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... -
25
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...