Cited in
(only showing first 100 items - show all)- Finding multiple Nash equilibria via machine learning-supported Gröbner bases
- The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems
- rs-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS
- GLOMIQO: global mixed-integer quadratic optimizer
- Finding multiplies solutions for non-linear integer programming
- A computational study of global optimization solvers on two trust region subproblems
- Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- Global optimization of general non-convex problems with intermediate bilinear substructures
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- Finding multiple solutions in nonlinear integer programming with algebraic test-sets
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- RAPOSa
- Deterministic global optimization in ab-initio quantum chemistry
- MELTS
- TACO: a toolkit for AMPL control optimization
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Three ideas for a feasibility pump for nonconvex MINLP
- Virtuous smoothing for global optimization
- Application of the polyblock method to special integer chance constrained problem
- Packing ellipses in an optimized convex polygon
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- HOMER
- Rounding-based heuristics for nonconvex MINLPS
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
- A branch-and-bound algorithm for instrumental variable quantile regression
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- Differentiable McCormick relaxations
- Three enhancements for optimization-based bound tightening
- Bound reduction using pairs of linear inequalities
- Large-scale standard pooling problems with constrained pools and fixed demands
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- A modified differential evolution based solution technique for economic dispatch problems
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
- Constrained global optimization for wine blending
- Empirical performance bounds for quantum approximate optimization
- Branching and bounds tighteningtechniques for non-convex MINLP
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Solving mixed integer bilinear problems using MILP formulations
- Pyomo -- optimization modeling in Python
- Impact of graph structures for QAOA on maxcut
- Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings
- A probing algorithm for MINLP with failure prediction by SVM
- Polynomial optimization for water networks: global solutions for the valve setting problem
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
- Global optimization of nonconvex problems with multilinear intermediates
- Communication protocols for options and results in a distributed optimization environment
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- A multi-item integrated inventory model with different replenishment frequencies of retailers in a two-echelon supply chain management: a tuned-parameters hybrid meta-heuristic
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- Piecewise polyhedral formulations for a multilinear term
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
- Global solution of non-convex quadratically constrained quadratic programs
- Template polyhedra and bilinear optimization
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- The supporting hyperplane optimization toolkit for convex MINLP
- The travelling salesman problem with neighbourhoods: MINLP solution
- A new algorithm for concave quadratic programming
- Optimizing a multi-stage production/inventory system by DC programming based approaches
- Upper bounding in inner regions for global optimization under inequality constraints
- An improved test set approach to nonlinear integer problems with applications to engineering design
- BARON
- SCICONIC
- SCIP
- LaGO
- ICOS
- Cbc
- LINDO
- COIN-OR
- Bonmin
- COCONUT
- AlphaECP
- OptimJ
- PyGlpk
- CLP
- ConicBundle
- alphaBB
- FilMINT
- JBool
- LINDOGlobal
- minlpBB
- GloMIQO
- MINOTAUR
- MINLPB4
- MISQPOA
- MIQL
- Ev3
- SBmethod
- COIN-OR/GAMSLinks
This page was built for software: Couenne
