Search Results for "jump"
Sort By:
Showing 13 open source projects for "jump"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
1
SCIP.jl
Julia interface to SCIP solver
SCIP.jl is a Julia interface to the SCIP solver. This wrapper is maintained by the SCIP project with the help of the JuMP community. -
2
vim‑sneak
The missing motion for Vim
vim‑sneak is a minimalist yet powerful navigation plugin for Vim, designed to jump to any location specified by two characters. It maintains compatibility with Vim's operators, macros, visual mode, repeat (.), and supports multibyte text. It provides intuitive highlights that disappear once the jump is completed. Sneak has <Plug> mappings for f and t 1-character-sneak. These mappings do not invoke label-mode, even if you have it enabled. -
3
HiGHS.jl
Julia wrapper for the HiGHS solver
HiGHS.jl is a wrapper for the HiGHS solver. -
4
SumOfSquares.jl
Sum of Squares Programming for Julia
SumOfSquares.jl is a JuMP extension that, when used in conjunction with MultivariatePolynomial and PolyJuMP, implements a sum of squares reformulation for polynomial optimization. -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
nvim-hlslens
Hlsearch Lens for Neovim
nvim-hlslens helps you better glance at matched information, and seamlessly jump between matched instances. -
6
Coluna.jl
Branch-and-Price-and-Cut in Julia
Coluna is a branch-and-price-and-cut framework written in Julia. You write an original MIP that models your problem using the JuMP modeling language and our specific extension BlockDecomposition offers a syntax to specify the problem decomposition. Then, Coluna reformulates the original MIP and optimizes the reformulation using the algorithms you choose. Coluna aims to be very modular and tweakable so that you can define the behavior of your customized branch-and-price-and-cut algorithm. -
7
Polyhedra
Polyhedral Computation Interface
Polyhedra provides an unified interface for Polyhedral Computation Libraries such as CDDLib.jl. This manipulation notably includes the transformation from (resp. to) an inequality representation of a polyhedron to (resp. from) its generator representation (convex hull of points + conic hull of rays) and projection/elimination of a variable with e.g. Fourier-Motzkin. -
8
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. -
9
InfiniteOpt.jl
An intuitive modeling interface for infinite-dimensional optimization
A JuMP extension for expressing and solving infinite-dimensional optimization problems. InfiniteOpt.jl provides a general mathematical abstraction to express and solve infinite-dimensional optimization problems (i.e., problems with decision functions). Such problems stem from areas such as space-time programming and stochastic programming. -
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
10
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... -
11
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... -
12
Catalyst.jl
Chemical reaction network and systems biology interface
...Symbolic ReactionSystems can be used to generate ModelingToolkit-based models, allowing the easy simulation and parameter estimation of mass action ODE models, Chemical Langevin SDE models, stochastic chemical kinetics jump process models, and more. Generated models can be used with solvers throughout the broader SciML ecosystem, including higher-level SciML packages (e.g. for sensitivity analysis, parameter estimation, machine learning applications, etc). -
13
TeNeM (Telecommunications Network Model) is a PostgreSQL schema with PL/pgSQL functions and triggers intended to make with a fiber optic network management. It is also a GIS JUMP plug-in to edit and visualize the data. PostGIS is used to extend Postgre.
- Previous
- You're on page 1
- Next