VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
PDF
  • Heuristics for NP-hard optimization problems : simpler is better !?
    Žerovnik, Janez, 1958-
    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.
    Vir: Logistics & sustainable transport. - ISSN 1854-3332 (Vol. 6, nr. 1, Nov. 2015, str. 1-10)
    Vrsta gradiva - članek, sestavni del
    Leto - 2015
    Jezik - angleški
    COBISS.SI-ID - 14386203