A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions

From MaRDI portal
Publication:706948


DOI10.1016/j.ejor.2003.08.053zbMath1071.90035MaRDI QIDQ706948

Patrick Siarry, Rachid Chelouah

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.08.053


90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization


Related Items



Cites Work