An optimal algorithm for global optimization and adaptive covering
From MaRDI portal
Recommendations
Cites work
- 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 108350 (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?)
- 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
- 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.
- 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)
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)