An optimal algorithm for global optimization and adaptive covering

DOI10.1007/S10898-016-0416-6MaRDI QIDQ727397zbMATH OpenOpenAlexFDO

Authors Serge L. Shishkin, Alan M. Finn

Publication date 6 December 2016

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-016-0416-6

zbMATH Keywords

adaptive coveringbranch and boundcomplexityglobal optimizationoptimal algorithms

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Global optimization
• Target-oriented branch and bound method for global optimization
• A cover partitioning method for bound constrained global optimization
• New results on verified global optimization
• scientific article; zbMATH DE number 4099040

Cites work

• A spatial domain decomposition method for parabolic optimal control problems
• An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
• An efficient dynamically adaptive mesh for potentially singular solutions
• Deterministic global optimization. Theory, methods and applications
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• Local adaptive mesh refinement for shock hydrodynamics
• On the convergence of grid-based methods for unconstrained optimization
• On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning
• Optimal aeroacoustic shape design using the surrogate management framework
• Parametrized complexity theory.
• Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
• Table of integrals, series, and products. Translated from the Russian. Translation edited and with a preface by Alan Jeffrey and Daniel Zwillinger. With one CD-ROM (Windows, Macintosh and UNIX)
• Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling

Cited in

(2)

• Intelligent-guided adaptive search for the maximum covering location problem
• scientific article; zbMATH DE number 822308 (Why is no real title available?)

This page was built for publication: An optimal algorithm for global optimization and adaptive covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727397)