Pages that link to "Item:Q645553"

The following pages link to A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms (Q645553):

Displaying 8 items.

• The small octagons of maximal width (Q1953053) (← links)
• On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method (Q2018467) (← links)
• On rigorous upper bounds to a global optimum (Q2250091) (← links)
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
• A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces (Q5746707) (← links)
• An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices (Q5964239) (← links)
• Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)