An optimal algorithm for global optimization and adaptive covering

DOI10.1007/s10898-016-0416-6zbMath1383.90027OpenAlexW2275505509MaRDI QIDQ727397

Alan M. Finn, Serge L. Shishkin

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

complexityglobal optimizationbranch and boundoptimal algorithmsadaptive covering

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• A spatial domain decomposition method for parabolic optimal control problems
• Local adaptive mesh refinement for shock hydrodynamics
• On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning
• Deterministic global optimization. Theory, methods and applications
• Parametrized complexity theory.
• Optimal aeroacoustic shape design using the surrogate management framework
• On the Convergence of Grid-Based Methods for Unconstrained Optimization
• An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
• Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
• An efficient dynamically adaptive mesh for potentially singular solutions