Experiments with a new selection criterion in a fast interval optimization algorithm
From MaRDI portal
Recommendations
- Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
- Interval tools for global optimization
- A fast memoryless interval-based algorithm for global optimization
- New subinterval selection criteria for interval global optimization
- New interval analysis support functions using gradient information in a global minimization algorithm
Cited in
(15)- Heuristic rejection in interval global optimization
- Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
- Optimality and duality for second-order interval-valued variational problems
- New interval methods for constrained global optimization
- Optimal centers in branch-and-prune algorithms for univariate global optimization
- A new pruning test for finding all global minimizers of nonsmooth functions
- An efficient interval computing technique for bound-constrained uncertain optimization problems
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- New subinterval selection criteria for interval global optimization
- A posteriori direction selection rules for interval optimization methods
- Node selection strategies in interval branch and bound algorithms
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- Solving a huff-like competitive location and design model for profit maximization in the plane
- A fast memoryless interval-based algorithm for global optimization
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
This page was built for publication: Experiments with a new selection criterion in a fast interval optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5940042)
