| Article ID: | iaor20043186 |
| Country: | Netherlands |
| Volume: | 151 |
| Issue: | 2 |
| Start Page Number: | 389 |
| End Page Number: | 399 |
| Publication Date: | Dec 2003 |
| Journal: | European Journal of Operational Research |
| Authors: | Mladenovi N., Petrovi J., Kovaevi-Vuji V., angalovi |
| Keywords: | heuristics |
A basic variable neighbourhood search (VNS) heuristic is applied for the first time to continuous min–max global optimization problems. The method is tested on a class of NP-hard global optimization problems arising from the synthesis of radar polyphase codes that has already been successfully treated by tabu search. The computational results show that VNS in average outperforms tabu search.