A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
type: Item
instance of: scholarly article
title: A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
zbMATH Open document ID: 1228.90084
author: Jordan Ninin
author: Frédéric Messine
published in: Journal of Global Optimization
publication date: 2011-11-08T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5969577
zbMATH Keywords: interval analysis
zbMATH Keywords: branch and bound
zbMATH Keywords: limited memory
zbMATH Keywords: metaheuristic
zbMATH Keywords: algorithmic complexity
describes a project that uses: INTOPT_90
MaRDI profile type: Publication
full work available at URL: s10898-010-9531-y
OpenAlex ID: W2066433902
cites work: Experiments with a new selection criterion in a fast interval optimization algorithm
cites work: Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
cites work: Generalized subinterval selection criteria for interval global optimization
cites work: Q4004279
cites work: Rigorous global search: continuous problems
cites work: Deterministic global optimization using interval constraint propagation techniques
cites work: A Deterministic Global Optimization Algorithm for Design Problems
cites work: Q4520756
cites work: Q5566070
cites work: Q4040272
cites work: Global Optimization and Constraint Satisfaction
cites work: Empirical investigation of the convergence speed of inclusion functions in a global otimization context
DOI: 10.1007/S10898-010-9531-Y
description: scientific article; zbMATH DE number 5969577