JuMP

swMATH16108MaRDI QIDQ27980FDOQ27980

Author name not available (Why is that?)

Official website: https://github.com/JuliaOpt/JuMP.jl

Source code repository: https://github.com/JuliaOpt/JuMP.jl

Described by source

• JuMP: a modeling language for mathematical optimization

Cited In (only showing first 100 items - show all)

• Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
• Non-convex nested Benders decomposition
• Asymptotically tight conic approximations for chance-constrained AC optimal power flow
• Reinterpretation and extension of entropy correction terms for residual distribution and discontinuous Galerkin schemes: application to structure preserving discretization
• Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
• Numerical computation of the cut locus via a variational approximation of the distance function
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
• A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization
• Exact converging bounds for stochastic dual dynamic programming via Fenchel duality
• RSOME
• VRPSolver
• Problem-driven scenario generation: an analytical approach for stochastic programs with tail risk measure
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
• Linearized formulations for failure aware barter exchange
• ROmodel
• ROC++
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Maximum probabilistic all-or-nothing paths
• Pyomo.GDP: an ecosystem for logic based modeling and optimization development
• Curve-shortening of open elastic curves with repelling endpoints: a minimizing movements approach
• Piecewise polyhedral formulations for a multilinear term
• Exact first-choice product line optimization
• Bounding the separable rank via polynomial optimization
• MINLP formulations for continuous piecewise linear function fitting
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects
• On efficient Hessian computation using the edge pushing algorithm in Julia
• Generalized risk parity portfolio optimization: an ADMM approach
• On polyhedral and second-order cone decompositions of semidefinite optimization problems
• Dynamic location of modular manufacturing facilities with relocation of individual modules
• Sequence of polyhedral relaxations for nonlinear univariate functions
• Optimal crashing of an activity network with disruptions
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
• Self-triggered adaptive model predictive control of constrained nonlinear systems: a min-max approach
• Data-driven tuning for chance constrained optimization: analysis and extensions
• Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems
• Sum-of-squares methods for controlled invariant sets with applications to model-predictive control
• BartSim
• EMSSim
• MathOptInterface: A Data Structure for Mathematical Optimization Problems
• ROC++: Robust Optimization in C++
• Approximate super-resolution of positive measures in all dimensions
• A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
• Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
• Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
• Partially observable multistage stochastic programming
• Exploiting term sparsity in noncommutative polynomial optimization
• A Bayesian framework for molecular strain identification from mixed diagnostic samples
• Exploiting sparsity in complex polynomial optimization
• COSMO: a conic operator splitting method for convex conic problems
• COVID-19 optimal vaccination policies: a modeling study on efficacy, natural and vaccine-induced immunity responses
• Optimizing subscriber migrations for a telecommunication operator in uncertain context
• JANOS
• Variable selection in convex quantile regression: \(\mathcal{L}_1\)-norm or \(\mathcal{L}_0\)-norm regularization?
• Frameworks and results in distributionally robust optimization
• Integrating nurse assignment in outpatient chemotherapy appointment scheduling
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
• On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems
• A general ``power-of-\(d\) dispatching framework for heterogeneous systems
• A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
• Certifiably optimal sparse principal component analysis
• Electricity market equilibrium under information asymmetry
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• The software design of gridap: a finite element package based on the Julia JIT compiler
• Loki
• Gurobi
• GLPK
• Mosek
• Ipopt
• ROME
• AIMMS
• Pyomo
• PySP
• DSP
• MINOTAUR
• ROI
• PICOS
• CasADi
• BLOOMP
• amodMC
• ACCPM
• ColPack
• MATPOWER
• MineLib
• MENU-OKF
• MOD-DIST
• SITATION
• FortSP
• APOGEE
• SEQDESIGN
• ADIC2
• BaPCod
• OOPS
• adaptTest
• edge_push_sp
• ComputeTW
• Bocop
• CVRPSEP
• FOMCON
• SUTIL

This page was built for software: JuMP