20.500.12556/DKUM-69004 Heuristics for NP-hard optimization problems simpler is better !? 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. optimization metaheuristics local search greedy construction traveling salesman problem požrešna metoda konstrukcijska hevristika lokalno iskanje problem trgovskega potnika optimizacija metahevristika true false true Angleški jezik Slovenski jezik Znanstveno delo 2017-11-17 08:39:58 2017-11-17 08:41:08 2022-08-01 16:46:42 2019-07-11 17:17:49 2015 0 0 str. 1-10 št. 1 Letn. 6 Nov. 2015 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 1854-3332 658.788(045) 222476800 14386203 10.1515/jlst-2015-0006 1854-3332 URN:SI:UM:DK:BOBIACLN Logistics_&_Sustainable_Transport_2015_Zerovnik_Heuristics_for_NP-hard_optimization_problems_-_simpler_is_better!.pdf Logistics_&_Sustainable_Transport_2015_Zerovnik_Heuristics_for_NP-hard_optimization_problems_-_simpler_is_better!.pdf 1 D10EA8529D9E1704550778D0FB866D06 b7207fa6164c515e98a978323b8726439c68fbe2dfffcaa66e8cc8d4cfcb811c 80d00707-7c0f-11eb-bb7a-00155d0001ca 20.500.12556/dkum/2a973926-ea95-404f-8839-62a29155ee31 https://dk.um.si/Dokument.php?lang=slv&id=120357 https://www.degruyter.com/view/j/jlst.2015.6.issue-1/jlst-2015-0006/jlst-2015-0006.xml 1 https://dk.um.si/Dokument.php?lang=slv&id=120356 Fakulteta za logistiko Logistics, supply chain, sustainability and global challenges 0 0 0