BARON
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A local exploration-based differential evolution algorithm for constrained global optimization
- Global solution of bilevel programs with a nonconvex inner program
- A global continuation algorithm for solving binary quadratic programming problems
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Cutting circles and polygons from area-minimizing rectangles
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Global Optimization Toolbox For Maple
- GLOPT
- INTBIS
- INTLIB
- KNITRO
- LGO
- Mathomatic
- GAMS.jl
- PSwarm
- Delaunay.jl
- NCNBD.jl
- SOS-SDP
- BASBLib
- BASBL
- HiGHS
- EAGO.jl
- PaPILO
- BadNets
- Sageopt
- Interactions between nonlinear programming and modeling systems
- UniCalc
- SCICONIC
- SCIP
- A finite algorithm for global minimization of separable concave programs
- A pseudo-global optimization approach with application to the design of containerships
- Modeling languages in mathematical optimization.
- Identification of piecewise affine systems via mixed-integer programming.
- LaGO
- McCormick
- SNOPT
- GAHC
- GLOPTLAB
- CONOPT
- MOLFP
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- AMPL
- SeDuMi
- ICOS
- testenv
- A hybrid LP/NLP paradigm for global optimization relaxations
- CPLEX
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
- Gurobi
- HOPSPACK
- TOMLAB
- Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
- SparsePOP
- SolvOpt
- GloptiPoly
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Couenne
- A MIQCP formulation for B-spline constraints
- RealPaver
- Weighted quadrature rules via Grüss type inequalities for weighted \(L^{p}\) spaces
- On decomposability of multilinear sets
- HTCondor MW
- Cbc
- An algorithm based on semidefinite programming for finding minimax optimal designs
- LINDO
- A computational study of global optimization solvers on two trust region subproblems
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- Certificates of infeasibility via nonsmooth optimization
- Strong valid inequalities for Boolean logical pattern generation
- MINTO
- COIN-OR
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
- Improving biorefinery planning: integration of spatial data using exact optimization nested in an evolutionary strategy
- GLOBALLib
- Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets
- NDA
- Virtuous smoothing for global optimization
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- INTOPT_90
- Knapsack
- filterSQP
- COCONUT
- Bonmin
- MIDACO
- MINLP
- FEASPUMP
- Ipopt
- QP
- XPRESS
- Domain reduction techniques for global NLP and MINLP optimization
- LocalSolver
- CppAD
- ROSE
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Pyomo
- AIMMS
- DICOPT
- MINOPT
- AlphaECP
This page was built for software: BARON
