The following pages link to BARON (Q12838):
Displaying 50 items.
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds (Q2176280) (← links)
- Non-convex quadratic programming problems in short wave antenna array optimization (Q2181741) (← links)
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
- Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
- On the complexity of detecting convexity over a box (Q2191776) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms (Q2218447) (← links)
- A solution method for heterogeneity involving present bias (Q2218886) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← links)
- Detecting and solving aircraft conflicts using bilevel programming (Q2231332) (← links)
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique (Q2241566) (← links)
- The weighted intruder path covering problem (Q2242227) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- On the computation of all eigenvalues for the eigenvalue complementarity problem (Q2250083) (← links)
- A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
- On rigorous upper bounds to a global optimum (Q2250091) (← links)
- Multivariate McCormick relaxations (Q2250101) (← links)
- Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
- A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems (Q2254189) (← links)
- The location-allocation problem of drone base stations (Q2273669) (← links)
- Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations (Q2274881) (← links)
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables (Q2274882) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- Optimal influenza vaccine distribution with equity (Q2286989) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
- Feasibility and cost minimisation for a lithium extraction problem (Q2289901) (← links)
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks (Q2294075) (← links)
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
- Multiperiod optimization model for oilfield production planning: bicriterion optimization and two-stage stochastic programming model (Q2302375) (← links)
- Optimal exact designs of experiments via mixed integer nonlinear programming (Q2302472) (← links)
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case (Q2309467) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
- Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization (Q2331356) (← links)
- Global optimality bounds for the placement of control valves in water supply networks (Q2331359) (← links)
- A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem (Q2337383) (← links)
- Optimal-constrained multicast sub-graph over coded packet networks (Q2343995) (← links)
- Some observations on exclusion regions in branch and bound algorithms (Q2349518) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- Active allocation of systematic risk and control of risk sensitivity in portfolio optimization (Q2355106) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- The optimization test environment (Q2357211) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
