The following pages link to BARON (Q12838):
Displayed 50 items.
- Minimizing the sum of many rational functions (Q266410) (← links)
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- Transformation-based preprocessing for mixed-integer quadratic programs (Q283953) (← links)
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (Q321039) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method (Q336618) (← links)
- Solving quality control problems with an algorithm for minimax programs with coupled constraints (Q336795) (← links)
- A planar single facility location and border crossing problem (Q339663) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- A non-parametric approach to demand forecasting in revenue management (Q342029) (← links)
- Divisive heuristic for modularity density maximization (Q342346) (← links)
- Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution (Q342547) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Tacit collusion games in pool-based electricity markets under transmission constraints (Q368752) (← links)
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- A heuristic approach to a single stage assembly problem with transportation allocation (Q387489) (← links)
- On the optimal design of water distribution networks: a practical MINLP approach (Q400003) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Convex envelopes of products of convex and component-wise concave functions (Q427364) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← links)
- On the solution of the inverse eigenvalue complementarity problem (Q467406) (← links)
- Energy-optimal multi-goal motion planning for planar robot manipulators (Q467470) (← links)
- A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations (Q473730) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Empirical decision model learning (Q511793) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- Model predictive control with discrete actuators: theory and application (Q518326) (← links)
- Differentiable McCormick relaxations (Q522264) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- 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 (Q532932) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- A new local and global optimization method for mixed integer quadratic programming problems (Q606807) (← links)
- Constraint propagation on quadratic constraints (Q606897) (← links)
- A numerical study of diagonally split Runge-Kutta methods for PDEs with discontinuities (Q618376) (← links)
- High order strong stability preserving time discretizations (Q618442) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)