Applying Algorithm Selection – a Case Study for the Generalised Assignment Problem

© 2018 Elsevier B.V. Many combinatorial optimisation problems are NP-Hard. Yet in practice high quality solutions are often obtained by (meta)heuristics. These work well in some cases, but not in others, indicating a potential for algorithm selection. In this extended abstract is discussed how to apply algorithm selection to a combinatorial optimisation problem and which challenges arise when doing so. The generalised assignment problem is used as case study.

Jaar van publicatie:2018

Toegankelijkheid:Closed