Dependency Packages
-
ADI.jl6Algorithms for performing angular differential imaging (ADI)
-
AlgorithmicCompetition.jl3Computational models of algorithmic competition
-
Allocations.jl1Algorithms for fair item allocation.
-
Alpine.jl245A Julia/JuMP-based Global Optimization Solver for Non-convex Programs
-
Anneal.jl15🔵 QUBO Annealing & Sampling MOI Interfaces
-
AnyMOD.jl69Julia framework for energy system models with a focus on multi-period capacity expansion
-
AutomationLabs.jl5A powerful, no code solution for control and systems engineering
-
AutomationLabsDepot.jl2Warehouse for dynamical systems identification and control
-
AutomationLabsExportation.jl1Advanced exports management for AutomationLabs.jl
-
AutomationLabsModelPredictiveControl.jl4Advanced process control for AutomationLabs
-
AutomationLabsSystems.jl2Advanced systems management for AutomationLabs
-
BDisposal.jl0Non parametric productivity analysis under the B-disposal assumption
-
BellDiagonalQudits.jl6-
-
BellPolytopes.jl3This julia package addresses the membership problem for local polytopes: it constructs Bell inequalities and local models in multipartite Bell scenarios with binary outcomes.
-
BellScenario.jl6Compute Bell inequalities and their quantum violations.
-
BenchmarkingEconomicEfficiency.jl2A Julia package for economic efficiency measurement using Data Envelopment Analysis (DEA)
-
BilevelJuMP.jl103Bilevel optimization in JuMP
-
BilevelOptimization.jl49JuMP-based toolbox for solving bilevel optimization problems
-
BiodiversityObservationNetworks.jl2Methods for optimizing the spatial location of biodiversity-observation-networks
-
BioGraph.jl11A Julia package for handle genome graph in the GFA format.
-
BirkhoffDecomposition.jl4Julia package for decomposing doubly stochastic matrices
-
BlankLocalizationCore.jl1Julia implementation of our multi-operation blank localization method
-
BlockDecomposition.jl27Extension of JuMP to model decomposable mathematical programs (using Benders or Dantzig-Wolfe decomposition paradigm)
-
BranchAndBound.jl20A Julia framework for implementing branch-and-bound-type algorithms
-
BranchFlowModel.jl1An easy to use implementation of the Branch Flow Model using JuMP for optimal power flow problems
-
BundleMethod.jl10Bundle Methods in Julia
-
CALiPPSO.jl7Julia package for producing jammed configurations of hard-spheres using iterative linear programming.
-
CanDecomp.jl2CanDecomp (CP) Tensor Decomposition
-
CapacityExpansion.jl24Capacity Expansion Problem Formulation for Julia
-
CauViz.jl0This is an visualization package.
-
CbaOPF.jl8An optimal power flow tool for perfoming CBA analysis of AC/DC networks
-
CBLS.jl4A MOI/JuMP interface for `LocalSearchSolvers.jl`, a Constraint-Based Local Search (CBLS) framework
-
CDDLib.jl36Cdd wrapper module for Julia. cdd is a library for polyhedra manipulation such as double description and Fourier-Motzkin elimination
-
ChooseOptimizer.jl3Tool to select different optimization engines and set options.
-
Chordal.jl24-
-
ClimateMARGO.jl67Julia implementation of MARGO, an idealized climate-economic modelling framework for Optimizing trade-offs between emissions Mitigation, Adaptation, carbon dioxide Removal, and solar Geoengineering.
-
ClosedLoopReachability.jl44Reachability analysis for closed-loop control systems in Julia
-
ClustForOpt.jl82Julia implementation of unsupervised learning methods for time series datasets. It provides functionality for clustering and aggregating, detecting motifs, and quantifying similarity between time series datasets.
-
COBRA.jl60High-level, high-performance, constraint-based reconstruction and analysis in Julia
-
COBREXA.jl9COnstraint Based Reconstruction and EXascale Analysis (in Julia)
Loading more...