Pages that link to "Item:Q1924072"

The following pages link to BARON: A general purpose global optimization software package (Q1924072):

Displaying 50 items.

• Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
• On the complexity of detecting convexity over a box (Q2191776) (← 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)
• Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique (Q2241566) (← 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)
• A note on convex reformulation schemes for mixed integer quadratic programs (Q2251547) (← links)
• A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems (Q2254189) (← links)
• Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
• A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
• Optimal influenza vaccine distribution with equity (Q2286989) (← 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)
• Multiperiod optimization model for oilfield production planning: bicriterion optimization and two-stage stochastic programming model (Q2302375) (← 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)
• Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← 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)
• Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← 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)
• Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← 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)
• A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs (Q2502217) (← 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)
• Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
• A computational study on QP problems with general linear constraints (Q2673522) (← links)
• An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
• A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey (Q2691459) (← links)
• Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
• Mean–variance portfolio optimization with parameter sensitivity control^† (Q2829560) (← links)
• Solving chance-constrained optimization problems with stochastic quadratic inequalities (Q2830767) (← links)
• Algorithmic differentiation techniques for global optimization in the COCONUT environment (Q2885482) (← links)
• Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)