Pages that link to "Item:Q642467"

The following pages link to Deterministic global optimization. Geometric branch-and-bound methods and their applications (Q642467):

Displaying 21 items.

• Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem (Q299429) (← links)
• A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
• On a global optimization algorithm for bivariate smooth functions (Q481774) (← links)
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods (Q609566) (← links)
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
• New external estimate for the reachable set of a nonlinear multistep dynamic system (Q1644011) (← links)
• On convergence rate of a rectangular partition based global optimization algorithm (Q1754460) (← links)
• Deterministic global optimization. Theory, methods and applications (Q1962863) (← links)
• Nonconvex constrained optimization by a filtering branch and bound (Q2038915) (← links)
• A hybrid of Bayesian approach based global search with clustering aided local refinement (Q2206585) (← links)
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
• Steklov regularization and trajectory methods for univariate global optimization (Q2301181) (← links)
• Geometric branch-and-bound methods for constrained global optimization problems (Q2434637) (← links)
• An exact framework for the discrete parallel machine scheduling location problem (Q2668759) (← links)
• A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
• A branch-and-bound approach for estimating covering functionals of convex bodies (Q2696981) (← links)
• Simplicial Global Optimization (Q2851341) (← links)
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application (Q3494393) (← links)
• Implementation techniques for geometric branch-and-bound matching methods (Q4419487) (← links)
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
• Branch and probability bound methods in multi-objective optimization (Q5963235) (← links)