Pages that link to "Item:Q5940042"
From MaRDI portal
The following pages link to Experiments with a new selection criterion in a fast interval optimization algorithm (Q5940042):
Displaying 13 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms (Q645553) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
- Heuristic rejection in interval global optimization (Q1407232) (← links)
- Numerical experiences with a new generalized subinterval selection criterion for interval global optimization (Q1810785) (← links)
- Optimality and duality for second-order interval-valued variational problems (Q2089248) (← 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)
- An efficient interval computing technique for bound-constrained uncertain optimization problems (Q2926481) (← links)
- Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)
