An optimal algorithm for global optimization and adaptive covering
type: Item
instance of: scholarly article
title: An optimal algorithm for global optimization and adaptive covering
zbMATH Open document ID: 1383.90027
author: Serge L. Shishkin
author: Alan M. Finn
published in: Journal of Global Optimization
publication date: 2016-12-06T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6661490
zbMATH Keywords: global optimization
zbMATH Keywords: branch and bound
zbMATH Keywords: adaptive covering
zbMATH Keywords: complexity
zbMATH Keywords: optimal algorithms
MaRDI profile type: Publication
full work available at URL: s10898-016-0416-6
OpenAlex ID: W2275505509
cites work: Q3967358
cites work: Q4324980
cites work: Deterministic global optimization. Theory, methods and applications
cites work: Q5187067
cites work: Q4023809
cites work: Optimal aeroacoustic shape design using the surrogate management framework
cites work: On the convergence of grid-based methods for unconstrained optimization
cites work: Local adaptive mesh refinement for shock hydrodynamics
cites work: An efficient dynamically adaptive mesh for potentially singular solutions
cites work: A spatial domain decomposition method for parabolic optimal control problems
cites work: On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning
cites work: Q3331506
cites work: Q3084090
cites work: Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
cites work: Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
cites work: Parametrized complexity theory.
cites work: An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
DOI: 10.1007/S10898-016-0416-6
description: scientific article; zbMATH DE number 6661490