The following pages link to BARON (Q12838):
Displaying 50 items.
- Integration of expert knowledge into radial basis function surrogate models (Q2358065) (← links)
- Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
- Interval unions (Q2359762) (← links)
- Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures (Q2376120) (← links)
- Modeling technology adoptions for sustainable development under increasing returns, uncertainty, and heterogeneous agents (Q2378400) (← links)
- Relaxation and decomposition methods for mixed integer nonlinear programming. (Q2386510) (← links)
- Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
- A multi-commodity flow formulation for the generalized pooling problem (Q2392115) (← links)
- Bound reduction using pairs of linear inequalities (Q2392123) (← links)
- Strong formulations for the pooling problem (Q2392127) (← links)
- Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) (← links)
- Deterministic global optimization in ab-initio quantum chemistry (Q2392771) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution (Q2393472) (← links)
- Design of a public bicycle-sharing system with safety (Q2398146) (← links)
- A global optimization framework for distributed antenna location in CDMA cellular networks (Q2399315) (← links)
- How to solve a design centering problem (Q2408900) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
- Packing circles into perimeter-minimizing convex hulls (Q2423783) (← links)
- Influence modeling: mathematical programming representations of persuasion under either risk or uncertainty (Q2424784) (← links)
- Global optimization of bounded factorable functions with discontinuities (Q2442640) (← links)
- Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
- Relaxations of factorable functions with convex-transformable intermediates (Q2452375) (← links)
- Constraint partitioning in penalty formulations for solving temporal planning problems (Q2457638) (← links)
- Global optimization in stabilizing controller design (Q2465481) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Robust optimization of contaminant sensor placement for community water systems (Q2492697) (← links)
- Nonlinear integer programming (Q2493143) (← links)
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs (Q2502217) (← links)
- A local relaxation approach for the siting of electrical substations (Q2506167) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
- A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
- Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- Convex relaxation for solving posynomial programs (Q2655346) (← links)
- Supply capacity acquisition and allocation with uncertain customer demands (Q2655615) (← links)
- Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
- Optimizing production capacity and safety stocks in general acyclic supply chains (Q2664281) (← links)
- Solving binary-constrained mixed complementarity problems using continuous reformulations (Q2668675) (← links)
- Finite inventory budgets in production capacity and safety stock placement under the guaranteed service approach (Q2668695) (← links)
- A computational study on QP problems with general linear constraints (Q2673522) (← links)
- Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings (Q2687068) (← links)
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization (Q2689856) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
