LINDOGlobal
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Domain reduction techniques for global NLP and MINLP optimization
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Extending a CIP framework to solve MIQCPs
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
- Data-driven modeling of \(\mathrm{CO}_2\) emission-allowance compensation for wood-purchasing optimization toward carbon-neutral forest industry
- Analyzing the computational impact of MIQCP solver components
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Differentiable McCormick relaxations
- Bound reduction using pairs of linear inequalities
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Mixed integer nonlinear programming tools: a practical overview
- QPLIB: a library of quadratic programming instances
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- A note on solving DiDi's driver-order matching problem
- Tighter McCormick relaxations through subgradient propagation
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Global optimization of nonconvex problems with multilinear intermediates
- Global optimization of nonconvex problems with convex-transformable intermediates
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- A global MINLP approach to symbolic regression
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Packing ellipsoids by nonlinear optimization
- The supporting hyperplane optimization toolkit for convex MINLP
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- BARON
- SCIP
- MCS
- Couenne
- Cbc
- LINDO
- GLOBALLib
- Bonmin
- CppAD
- MINLP
- AlphaECP
- QP
- DICOPT
- BQPD
- alphaBB
- FilMINT
- MINLPLib
- GloMIQO
- MINOTAUR
- SBB
- libMC
- GlobSol
- CQP
- glcCluster
- OQNLP
- ROSE
- GLOPEQ
- OSiL
- CGLS
- Ev3
- COIN-OR/GAMSLinks
- APOGEE
- STOP
- ANTIGONE
- DIP
- DINS
- IOSO
- coco_gop_ex
- LUMOD
- Boost Interval Arithmetic
- DataModeler
- CMU-IBM
- CENSO
- SHOT
- ManyOpt
- EXAMINER
- cyipopt
- PrincetonLib
- FilterSD
- OPTIMA
- IBMLib
- Globalizer
- Eureqa
- Decogo
- Muriqui
- SUSPECT
- POLIP
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Scheduling with compressible and stochastic release dates
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- A framework for globally optimizing mixed-integer signomial programs
- Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
- GLOMIQO: global mixed-integer quadratic optimizer
- A computational study of global optimization solvers on two trust region subproblems
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- RENS. The optimal rounding
- Global optimization of general non-convex problems with intermediate bilinear substructures
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
This page was built for software: LINDOGlobal
