Hybridizations of GRASP with path relinking for the far from most string problem
Year of publication: |
May 2016
|
---|---|
Authors: | Ferone, Daniele ; Festa, Paola ; Resende, Mauricio G. C. |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 23.2016, 3, p. 481-506
|
Subject: | string problems | consensus problems | combinatorial optimization | hybrid metaheuristics | Theorie | Theory | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
Alvarez-Valdes, Ramon, (2015)
-
Improving a state-of-the-art heuristic for the minimum latency problem with data mining
Santana, Ítalo, (2022)
-
MineReduce : an approach based on data mining for problem size reduction
Maia, Marcelo Rodrigues de Holanda, (2020)
- More ...
-
Efficient GRASP solution approach for the prisoner transportation problem
Ferone, Daniele, (2023)
-
GRASP with path-relinking for the cooperative communication problem on ad hoc networks
Commander, Clayton W., (2008)
-
Preface to the special issue on metaheuristics : recent advances and applications
Festa, Paola, (2025)
- More ...