Search Results for "mixed integer linear programming"
Sort By:
Showing 25 open source projects for "mixed integer linear programming"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
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.
-
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. OR-Tools is written in C++, but comes with wrappers for Python, C# and Java. ... -
2
Convex.jl
A Julia package for disciplined convex programming
Convex.jl is a Julia package for Disciplined Convex Programming (DCP). Convex.jl makes it easy to describe optimization problems in a natural, mathematical syntax, and to solve those problems using a variety of different (commercial and open-source) solvers. Convex.jl works by transforming the problem—which possibly has nonsmooth, nonlinear constructions like the nuclear norm, the log determinant, and so forth—into a linear optimization problem subject to conic constraints. This... -
3
InferOpt.jl
Combinatorial optimization layers for machine learning pipelines
InferOpt.jl is a toolbox for using combinatorial optimization algorithms within machine learning pipelines. It allows you to create differentiable layers from optimization oracles that do not have meaningful derivatives. Typical examples include mixed integer linear programs or graph algorithms. -
4
NVIDIA cuOpt
GPU accelerated decision optimization
NVIDIA cuOpt is a GPU-accelerated optimization engine designed to solve complex mathematical optimization problems at large scale. It supports a range of optimization models including linear programming (LP), mixed integer linear programming (MILP), quadratic programming (QP), and vehicle routing problems (VRP). Built primarily in C++, cuOpt leverages NVIDIA GPUs to deliver near real-time solutions for optimization tasks involving millions of variables and constraints. The platform provides multiple interfaces, including C, Python, and server APIs, allowing developers to integrate optimization capabilities into applications and services. cuOpt is designed for high-performance environments and can be deployed across cloud, hybrid, or on-premise infrastructures. ... -
Gemini 3 and 200+ AI Models on One PlatformBuild, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
-
5
Data Envelopment Analysis using Stata
Develop a user written Data Envelopment Analysis package in Stata.
The goal of this project is to develop a Data Envelopment Analysis(DEA) program using Stata programming language. This is the replacement of "deastata" project that we maintained for the purpose of version management. We call the program package "DEAS" which stands for Data Envelopment Analysis using Stata. DEAS covers the basic models of DEA and extensions including CCR, BCC, SBM, Super-efficiency Model, Allocative Model(Profit, Revenue, Cost), (Global) Malmquist Productivity Index Model, Imprecise DEA, FDH, Additive Model, Virtual Price Model, linear programming(lp), mixed integer linear programming(MILP), and more... -
6
CalcuFp
Programmable Calculator (IP functions, create user functions)
....- IPv4 functions), Apart from being able to have on hand an wide range of functions, allows to use different numbering systems WITHOUT CHANGING MODES. We can sum operations decimal, binary and hexadecimal mixed. Example. - 25 + BIN ('111 ') + HEX (' FF ') -> this is equivalent to adding the integer 25 +7 (binary) +255 (hexadecimal) = 287. Allows use of predefined variables and constants. Creating user functions. It has a programming section through type pascal scripts (still in testing), It has a multimedia viewer to store documentation that we have on hand for our daily tasks. ... -
7
Asset Management ProjectBuilder
Transportation Asset Management Project Builder
...PB features ample user interface that includes GIS-component. PB is developed in .NET/C# and T-SQL. It embeds third-party components and libraries, such as COIN-OR Symphony and Sylvan Excel that support mixed integer linear programming and export-import via Excel. All 3-rd party components are in the public domain. PB is licensed under the GNU Affero General Public License (AGPL) which can be found in the Docs folder of the reposito -
8
Algorithms Math Models
MATLAB implementations of algorithms
Algorithms_MathModels is a large MATLAB collection of algorithms and solved examples targeted at students and teams preparing for mathematical modeling competitions (national and international contests like MCM/ICM). The repository gathers implementations and case studies across many topics commonly used in contest solutions: optimization (linear, integer, goal and nonlinear programming), heuristic and metaheuristic methods (simulated annealing, genetic algorithms, immune algorithms), neural networks and time-series methods, interpolation and regression, graph theory, cellular automata, grey systems, fuzzy models, partial/ordinary differential equations, and multivariate analysis, among others. ... -
9
X11-Basic
A BASIC interpreter and compiler with graphics.
X11-Basic is a dialect of the BASIC programming language with graphics capability that integrates features like shell scripting, cgi-Programming and full graphical visualisation into the easy to learn basic language on modern computers. -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
10
lpsolve
Mixed Integer Linear Programming (MILP) 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 This project is moved to github: https://lp-solve.github.io/ -
11
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.
-
12
GLPK for Java
Java language binding for the GNU Linear Programming Kit (GLPK)
GLPK for Java provides a Java language binding for the library GLPK. GLPK is a proven solver for linear and mixed integer mathematical programming problems. For Windows binaries see project GLPK for Windows (http://sourceforge.net/projects/winglpk/). -
13
SONNET
SONNET (integer) linear optimisation in .NET
SONNET builds on top of the well-known COIN libraries for optimisation (see http://www.coin-or.org). It brings the power of (integer) linear programming projects of COIN to .NET. SONNET is licensed under the terms of the Eclipse Public License (EPL). SONNET consists of two parts: 1) A .NET library that consists of .NET wrapper classes around existing COIN classes such as OsiSolverInterface. 2) A .NET library implemented in C# that adds a powerful (rudimentary) modelling API with classes like Model, Constraint, Variable, Expression, etc, and overloaded operators to allow for things like Model model = new Model(); Variable x = new Variable(); Variable y = new Variable(); model.Add(2 * x + 3 * y <= 10); model.Objective = 3 * x + y; Solver solver = new Solver(model, typeof(OsiClpSolverInterface)); solver.Maximize(); Console.WriteLine(solver.ToSolutionString()); -
14
A java decision supporting application for the urban planning domain. It is designed as a desktop frontend to a Mixed Integer Programming engine. Actually it uses the GNU Linear Programming Kit (GLPK).
-
15
GLPK for Windows
Windows binaries for the GNU Linear Programming Kit (GLPK)
GLPK 4.65 (GNU Linear Programming Kit, http://www.gnu.org/software/glpk/) is a solver for large-scale linear programming (LP), and mixed integer programming (MIP). This project supplies the most recent Windows executables - 2018-03-17. Linux and OSX users should download the source distribution from http://ftp.gnu.org/gnu/glpk -
16
Arageli is a C++ library for computations in arithmetic, algebra, geometry, linear and integer linear programming. Arageli provides routines and classes that support precise, i.e. symbolic or algebraic, computations.
-
17
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 for model's grammar. Two system design model samples are provided. One uses the solver to identify low power network design for Passive Optical Networks given a set of choices for provider and customer premises equipment and a set of optical domain constraints. ... -
18
Bat2015
Bachelor of Science (Informatik)
The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. -
19
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 -
20
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
-
21
The problem of packing small boxes into a larger box underlies a number of cutting, packing, scheduling, and transportation applications. This solver for the problem, based on integer linear programming relaxations, beats previous work by far.
-
22
This is a series of *.java Classes for making programming tasks simpler, much like Apache Commons. Included in this src package is an Advanced Randomizer, TStringList Clone From Delphi, an Algorithem Class, and Method MultiTask Better than Runnables.
-
23
Java ILP is a simple java interface to (mixed) integer linear programming solvers such as lp_solve, Glpk, Gurobi, SAT4J (0-1 ILP), MiniSat+(0-1 ILP), CPLEX, or Mosek. (documentation at http://javailp.sourceforge.net/)
-
24
LinProg.NET is a framework for mathematical programming, supporting linear, integer, boolean and quadratic programming.
-
25
Path Partitioner
Finds bad examples for the local search Path Partitioning algorithm
Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G
- Previous
- You're on page 1
- Next
