scientific article; zbMATH DE number 2068068
From MaRDI portal
Publication:4464676
zbMath1176.90469MaRDI QIDQ4464676
Clifford A. Meyer, Christodoulos A. Floudas
Publication date: 27 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A review of recent advances in global optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer ⋮ Convex quadratic relaxations for mixed-integer nonlinear programs in power systems ⋮ On the impact of running intersection inequalities for globally solving polynomial optimization problems ⋮ A review of deterministic optimization methods in engineering and management ⋮ On convex relaxations of quadrilinear terms ⋮ Convex underestimation for posynomial functions of positive variables ⋮ Existence and sum decomposition of vertex polyhedral convex envelopes ⋮ Complete mixed integer linear programming formulations for modularity density based clustering ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ Global optimization of general nonconvex problems with intermediate polynomial substructures ⋮ On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation ⋮ Piecewise-linear approximations of multidimensional functions ⋮ Experimental validation of volume-based comparison for double-McCormick relaxations ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Convex envelopes for edge-concave functions ⋮ Performance of convex underestimators in a branch-and-bound framework ⋮ Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes ⋮ On the Composition of Convex Envelopes for Quadrilinear Terms ⋮ Global optimization of nonconvex problems with multilinear intermediates ⋮ Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
Uses Software
