Author of the publication

Simple ingredients leading to very efficient heuristics for the maximum clique problem.

, , and . J. Heuristics, 14 (6): 587-612 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem., , and . Oper. Res. Lett., 32 (1): 68-72 (2004)Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem., , and . Comput. Oper. Res., 39 (6): 1213-1217 (2012)A heuristic approach for the max-min diversity problem based on max-clique., , and . Comput. Oper. Res., 36 (8): 2429-2433 (2009)VNS solutions for the Critical Node Problem., , , and . Electron. Notes Discret. Math., (2015)Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine., and . Comput. Oper. Res., (2022)Simple ingredients leading to very efficient heuristics for the maximum clique problem., , and . J. Heuristics, 14 (6): 587-612 (2008)An experimental analysis of a population based approach for global optimization., , and . Comput. Optim. Appl., 38 (3): 351-370 (2007)Design of Logical Topologies in Wavelength-Routed IP Networks., , , , and . Photonic Netw. Commun., 4 (3-4): 423-442 (2002)Solving the problem of packing equal and unequal circles in a circular container., , , and . J. Glob. Optim., 47 (1): 63-81 (2010)Task and Memory Mapping of Large Size Embedded Applications over NUMA architecture✱., , , , , , and . RTNS, page 166-176. ACM, (2023)