Deterministic global optimization. Geometric branch-and-bound methods and their applications
DOI10.1007/978-1-4614-1951-8zbMATH Open1237.90002OpenAlexW2483998465MaRDI QIDQ642467FDOQ642467
Publication date: 26 October 2011
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1951-8
global optimizationmulti-objective optimizationlocation theoryconvergence theorygeometric branch-and bound
Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (18)
- Branch and probability bound methods in multi-objective optimization
- Geometric branch-and-bound methods for constrained global optimization problems
- Steklov regularization and trajectory methods for univariate global optimization
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- Nonconvex constrained optimization by a filtering branch and bound
- A decision space algorithm for multiobjective convex quadratic integer optimization
- Deterministic global optimization. Theory, methods and applications
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- An exact framework for the discrete parallel machine scheduling location problem
- New external estimate for the reachable set of a nonlinear multistep dynamic system
- On a global optimization algorithm for bivariate smooth functions
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- On convergence rate of a rectangular partition based global optimization algorithm
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A branch-and-bound approach for estimating covering functionals of convex bodies
- Implementation techniques for geometric branch-and-bound matching methods
- A hybrid of Bayesian approach based global search with clustering aided local refinement
Recommendations
- Geometric branch-and-bound methods for constrained global optimization problems 👍 👎
- Deterministic global optimization. Theory, methods and applications 👍 👎
- A deterministic global optimization algorithm for generalized geometric programming 👍 👎
- Title not available (Why is that?) 👍 👎
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application 👍 👎
- Title not available (Why is that?) 👍 👎
- Deterministic Global Optimization 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Deterministic global optimization. Geometric branch-and-bound methods and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642467)
