An optimal algorithm for global optimization and adaptive covering
From MaRDI portal
Publication:727397
DOI10.1007/S10898-016-0416-6zbMATH Open1383.90027OpenAlexW2275505509MaRDI QIDQ727397FDOQ727397
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
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local adaptive mesh refinement for shock hydrodynamics
- Parametrized complexity theory.
- Title not available (Why is that?)
- Deterministic global optimization. Theory, methods and applications
- Optimal aeroacoustic shape design using the surrogate management framework
- Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- An efficient dynamically adaptive mesh for potentially singular solutions
- A spatial domain decomposition method for parabolic optimal control problems
- 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
- An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
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)
