The following pages link to GloMIQO (Q18398):
Displaying 50 items.
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- Linear and parabolic relaxations for quadratic constraints (Q300753) (← links)
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption (Q506438) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Global optimization algorithm for mixed integer quadratically constrained quadratic program (Q515761) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- 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)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Global optimization of MIQCPs with dynamic piecewise relaxations (Q1668791) (← links)
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- A customized branch-and-bound approach for irregular shape nesting (Q1668808) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
- Analyzing the computational impact of MIQCP solver components (Q1940956) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- Bi-objective design-for-control of water distribution networks with global bounds (Q2138314) (← links)
- Optimization and validation of pumping system design and operation for water supply in high-rise buildings (Q2139132) (← links)
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (Q2250082) (← links)
- A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
- Cutting ellipses from area-minimizing rectangles (Q2250089) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- Multivariate McCormick relaxations (Q2250101) (← links)
- Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
- A note on convex reformulation schemes for mixed integer quadratic programs (Q2251547) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Global optimality bounds for the placement of control valves in water supply networks (Q2331359) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
