Pages that link to "Item:Q5940045"
From MaRDI portal
The following pages link to New subinterval selection criteria for interval global optimization (Q5940045):
Displaying 12 items.
- Optimal circle covering problems and their applications (Q302130) (← links)
- Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
- Two acceleration mechanisms in verified global optimization (Q861910) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems (Q868630) (← links)
- Generalized subinterval selection criteria for interval global optimization (Q2387747) (← links)
- New interval methods for constrained global optimization (Q2490338) (← links)
- Optimal centers in branch-and-prune algorithms for univariate global optimization (Q2572338) (← links)
- A new pruning test for finding all global minimizers of nonsmooth functions (Q2572719) (← links)
- A new inclusion function for optimization: kite -- the one-dimensional case (Q2574104) (← links)
- Subdivision Direction Selection in Interval Methods for Global Optimization (Q4340792) (← links)
- Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)