The following pages link to BARON (Q12838):
Displaying 50 items.
- A MIQCP formulation for B-spline constraints (Q1653267) (← links)
- Weighted quadrature rules via Grüss type inequalities for weighted \(L^{p}\) spaces (Q1659620) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
- Certificates of infeasibility via nonsmooth optimization (Q1675645) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm (Q1681158) (← links)
- Improving biorefinery planning: integration of spatial data using exact optimization nested in an evolutionary strategy (Q1681432) (← links)
- Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets (Q1683090) (← links)
- Virtuous smoothing for global optimization (Q1683327) (← links)
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (Q1685576) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
- Calculating the mean amplitude of glycemic excursions from continuous glucose data using an open-code programmable algorithm based on the integer nonlinear method (Q1734417) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (Q1753434) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
- A vector linear programming approach for certain global optimization problems (Q1756780) (← links)
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- Interval methods for semi-infinite programs (Q1773106) (← links)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- Mixed integer programming for a special logic constrained optimal control problem (Q1780957) (← links)
- On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)
- Finding multiple solutions in nonlinear integer programming with algebraic test-sets (Q1798325) (← links)
- Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
- Global optimization of 0-1 hyperbolic programs (Q1810871) (← links)
- Clouds, fuzzy sets, and probability intervals (Q1826444) (← links)
- Emissions trading and technology deployment in an energy-systems ``bottom-up'' model with technology learning (Q1827665) (← links)
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications (Q1856388) (← links)
- Review of nonlinear mixed-integer and disjunctive programming techniques (Q1863893) (← links)
- Solving large MINLPs on computational grids (Q1863899) (← links)
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study (Q1881050) (← links)
- A finite branch-and-bound algorithm for two-stage stochastic integer programs (Q1881566) (← links)
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design (Q1886847) (← links)
- Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints (Q1935885) (← links)
- An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
- Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
