| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Mladenović, Nenad | en |
| dc.contributor.author | Petrović, Jakov | en |
| dc.contributor.author | Kovačević-Vujčić, Vera | en |
| dc.contributor.author | Čangalović, Mirjana | en |
| dc.date.accessioned | 2020-05-02T16:42:15Z | - |
| dc.date.available | 2020-05-02T16:42:15Z | - |
| dc.date.issued | 2003-12-01 | en |
| dc.identifier.issn | 0377-2217 | en |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/2552 | - |
| dc.description.abstract | 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. | en |
| dc.publisher | Elsevier | - |
| dc.relation.ispartof | European Journal of Operational Research | en |
| dc.subject | Global optimization | Heuristics | Min-max problems | Tabu search | Variable neighbourhood search | en |
| dc.title | Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search | en |
| dc.type | Article | en |
| dc.identifier.doi | 10.1016/S0377-2217(02)00833-0 | en |
| dc.identifier.scopus | 2-s2.0-0042021846 | en |
| dc.relation.firstpage | 389 | en |
| dc.relation.lastpage | 399 | en |
| dc.relation.issue | 2 | en |
| dc.relation.volume | 151 | en |
| dc.description.rank | M22 | - |
| item.grantfulltext | none | - |
| item.cerifentitytype | Publications | - |
| item.fulltext | No Fulltext | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.openairetype | Article | - |
| crisitem.author.orcid | 0000-0001-6655-0409 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.