Pages that link to "Item:Q975771"
From MaRDI portal
The following pages link to A fast memoryless interval-based algorithm for global optimization (Q975771):
Displaying 5 items.
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms (Q645553) (← links)
- Interval branch and bound with local sampling for constrained global optimization (Q811876) (← links)
- Combining interval branch and bound and stochastic search (Q1725151) (← links)
- Adaptive memory programming for constrained global optimization (Q2379660) (← links)
- Experiments with a new selection criterion in a fast interval optimization algorithm (Q5940042) (← links)