Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
From MaRDI portal
(Redirected from Publication:1583690)
Recommendations
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- Interval Methods for Global Optimization Using the Boxing Method
- Optimal multisections in interval branch-and-bound methods of global optimization
- New interval methods for constrained global optimization
- New results on verified global optimization
Cited in
(31)- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
- Combining interval branch and bound and stochastic search
- Numerical solution for bounding feasible point sets
- A new multi-section based technique for constrained optimization problems with interval-valued objective function
- scientific article; zbMATH DE number 903760 (Why is no real title available?)
- On constrained optimization by interval arithmetic and interval order relations
- Theoretical justification of a heuristic subbox selection criterion for interval global optimization
- Interval oriented multi-section techniques for global optimization
- An efficient interval computing technique for bound-constrained uncertain optimization problems
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model
- A surprising approach in interval global optimization
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- The big cube small cube solution method for multidimensional facility location problems
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- A new solution of a global optimization problem of \(C^2\)-class by branch and bound method
- A new inclusion function for optimization: kite -- the one-dimensional case
- Use of an interval global optimization tool for exploring feasibility of batch extractive distillation
- Multilevel subdivision techniques for scalar optimization problems
- The cluster problem in multivariate global optimization
- A new pruning test for finding all global minimizers of nonsmooth functions
- On interval branch-and-bound for additively separable functions with common variables
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Subdomain separability in global optimization
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- Optimal multisections in interval branch-and-bound methods of global optimization
- scientific article; zbMATH DE number 524102 (Why is no real title available?)
- A multidimensional branch-and-prune method for interval global optimization
- Theoretical rate of convergence for interval inclusion functions
- (Global) optimization: historical notes and recent developments
- New interval methods for constrained global optimization
This page was built for publication: Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583690)
