Pages that link to "Item:Q367170"

The following pages link to GLOMIQO: global mixed-integer quadratic optimizer (Q367170):

Displaying 50 items.

• GloMIQO (Q18398) (← links)
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
• Linear and parabolic relaxations for quadratic constraints (Q300753) (← 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)
• Global optimization algorithm for mixed integer quadratically constrained quadratic program (Q515761) (← links)
• Three enhancements for optimization-based bound tightening (Q522269) (← links)
• A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• A MIQCP formulation for B-spline constraints (Q1653267) (← 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)
• Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← 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)
• SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
• Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← 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)
• Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations (Q2357903) (← links)
• ARGONAUT: algorithms for global optimization of constrained grey-box computational problems (Q2359400) (← links)
• Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
• Dual adaptive model predictive control (Q2407209) (← links)
• A partial outer convexification approach to control transmission lines (Q2419514) (← links)
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
• Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach (Q2630216) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
• Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Piecewise Linear Function Fitting via Mixed-Integer Linear Programming (Q3386779) (← links)