(Created page with " == Abstract == <jats:p> We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computational...") |
m (Scipediacontent moved page Draft Content 475943604 to Zerovnik 2015a) |
(No difference)
|
<jats:p> We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.
Document type: Article
The different versions of the original document can be found in:
under the license http://creativecommons.org/licenses/by-nc-nd/4.0/
Published on 01/01/2015
Volume 2015, 2015
DOI: 10.1515/jlst-2015-0006
Licence: Other
Are you one of the authors of this document?