A dual local search framework for combinatorial optimization problems with TSP application

Autor: Jamal Ouenniche, Michel Gendreau, Prasanna Kumar Ramaswamy

Publikováno v: Ouenniche, J, Ramaswamy, P K & Gendreau, M 2017, ' A dual local search framework for combinatorial optimization problems with TSP application ', Journal of the Operational Research Society, vol. 68, no. 11, pp. 1377-1398 . https://doi.org/10.1057/s41274-016-0173-4

In practice, solving realistically sized combinatorial optimization problems to optimality is often too time-consuming to be affordable; therefore, heuristics are typically implemented within most applications software. A specific category of heurist

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::acd42de99bef3b22099f1bd600cf4351
https://doi.org/10.1057/s41274-016-0173-4