Couenne

MaRDI QIDQ16526swMATHFDO

Official website https://projects.coin-or.org/Couenne

Cited in

(only showing first 100 items - show all)

• BARON
• SCICONIC
• SCIP
• LaGO
• ICOS
• Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
• Cbc
• LINDO
• A computational study of global optimization solvers on two trust region subproblems
• COIN-OR
• Virtuous smoothing for global optimization
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
• COCONUT
• Bonmin
• A branch-and-bound algorithm for instrumental variable quantile regression
• OptimJ
• PyGlpk
• On global optimization with indefinite quadratics
• AlphaECP
• CLP
• ConicBundle
• Polynomial optimization for water networks: global solutions for the valve setting problem
• Rounding-based heuristics for nonconvex MINLPS
• Globally solving nonconvex quadratic programming problems via completely positive programming
• Finding multiplies solutions for non-linear integer programming
• Finding multiple solutions in nonlinear integer programming with algebraic test-sets
• JBool
• LINDOGlobal
• FilMINT
• minlpBB
• alphaBB
• GloMIQO
• MINOTAUR
• MINLPB4
• MISQPOA
• MIQL
• A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
• SBmethod
• STOP
• Ev3
• A new algorithm for concave quadratic programming
• Penalized semidefinite programming for quadratically-constrained quadratic optimization
• \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
• COIN-OR/GAMSLinks
• BFOUR
• Empirical performance bounds for quantum approximate optimization
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• ANTIGONE
• The supporting hyperplane optimization toolkit for convex MINLP
• The p-Lagrangian relaxation for separable nonconvex MIQCQP problems
• Finding multiple Nash equilibria via machine learning-supported Gröbner bases
• MPL
• Global optimization of general nonconvex problems with intermediate polynomial substructures
• A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
• A primal heuristic for optimizing the topology of gas networks based on dual information
• Packing ellipses in an optimized convex polygon
• coco_gop_ex
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
• Template polyhedra and bilinear optimization
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities
• Global optimization of nonconvex problems with multilinear intermediates
• A modified differential evolution based solution technique for economic dispatch problems
• 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
• Three ideas for a feasibility pump for nonconvex MINLP
• Tobago
• Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures
• Large-scale standard pooling problems with constrained pools and fixed demands
• Bound reduction using pairs of linear inequalities
• Deterministic global optimization in ab-initio quantum chemistry
• MuShROOM
• qpHPSC
• Constrained global optimization for wine blending
• Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
• IbexOpt
• LUMOD
• QuadProgBB
• Piecewise polyhedral formulations for a multilinear term
• Impact of graph structures for QAOA on maxcut
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver
• XMLSpy
• DyLP
• CMPL
• pyCMPL
• Solving chance-constrained optimization problems with stochastic quadratic inequalities
• Solving mixed integer bilinear problems using MILP formulations
• An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
• EnergyPlus
• Communication protocols for options and results in a distributed optimization environment
• A probing algorithm for MINLP with failure prediction by SVM
• RLT-POS
• Optimization as an analysis tool for human complex problem solving
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• Lamatto++
• EIQP IIQP
• MIQCR-CB
• rs-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS
• Branching and bounds tighteningtechniques for non-convex MINLP
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
• GLOMIQO: global mixed-integer quadratic optimizer
• Semidefinite relaxations for non-convex quadratic mixed-integer programming

This page was built for software: Couenne