Couenne

swMATH4347MaRDI QIDQ16526FDOQ16526

Author name not available (Why is that?)

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

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

• Branching and bounds tighteningtechniques for non-convex MINLP
• Solving mixed integer bilinear problems using MILP formulations
• A primal heuristic for optimizing the topology of gas networks based on dual information
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• 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
• Communication protocols for options and results in a distributed optimization environment
• Threshold Boolean form for joint probabilistic constraints with random technology matrix
• The travelling salesman problem with neighbourhoods: MINLP solution
• The supporting hyperplane optimization toolkit for convex MINLP
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• Optimizing a multi-stage production/inventory system by DC programming based approaches
• Upper bounding in inner regions for global optimization under inequality constraints
• Strict linear prices in non-convex European day-ahead electricity markets
• A recipe for finding good solutions to MINLPs
• SCICONIC
• SCIP
• 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
• BFOUR
• STOP
• ANTIGONE
• MPL
• coco_gop_ex
• MuShROOM
• qpHPSC
• Tobago
• IbexOpt
• LUMOD
• QuadProgBB
• DyLP
• XMLSpy
• CMPL
• pyCMPL
• EnergyPlus
• \(rs\)-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS
• Global optimization of general non-convex problems with intermediate bilinear substructures
• GLOMIQO: global mixed-integer quadratic optimizer
• RLT-POS
• Lamatto++
• EIQP IIQP
• MIQCR-CB
• Juniper
• IQCP/MIQCP
• MAiNGO
• EMCC Optimizer
• PolySpace
• QPLIB
• QPBB
• adiabat_1ph
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
• quadprogIP
• FrankWolfe.jl
• TACO: a toolkit for AMPL control optimization
• Minotaur: a mixed-integer nonlinear optimization toolkit
• Globally solving nonconvex quadratic programming problems via completely positive programming
• Rounding-based heuristics for nonconvex MINLPS
• Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
• 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
• Bound reduction using pairs of linear inequalities
• Large-scale standard pooling problems with constrained pools and fixed demands
• \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
• RAPOSa
• Empirical performance bounds for quantum approximate optimization
• HOMER
• Pyomo -- optimization modeling in Python
• Impact of graph structures for QAOA on maxcut
• MELTS
• Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
• Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty
• A probing algorithm for MINLP with failure prediction by SVM
• An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations

This page was built for software: Couenne