Author of the publication

A biased random-key genetic algorithm for the Steiner triple covering problem.

, , , and . Optim. Lett., 6 (4): 605-619 (2012)

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

A Multi-population Genetic Algorithm for Tree-shaped Network Design Problems., and . IJCCI, page 177-182. INSTICC Press, (2009)A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks., and . Optim. Lett., 7 (6): 1303-1324 (2013)The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications., , , and . Eur. J. Oper. Res., 289 (1): 17-30 (2021)An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem., , , , , and . SEA, volume 6630 of Lecture Notes in Computer Science, page 421-433. Springer, (2011)A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties., and . Comput. Oper. Res., 36 (10): 2707-2715 (2009)A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources., , and . Eur. J. Oper. Res., 306 (3): 1140-1157 (2023)Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm., , , and . SEA, volume 6049 of Lecture Notes in Computer Science, page 338-349. Springer, (2010)A biased random-key genetic algorithm for the Steiner triple covering problem., , , and . Optim. Lett., 6 (4): 605-619 (2012)A Hybrid Genetic Algorithm for the Early/tardy Scheduling Problem., , and . Asia Pac. J. Oper. Res., 23 (3): 393-405 (2006)A parallel multi-population biased random-key genetic algorithm for a container loading problem., and . Comput. Oper. Res., 39 (2): 179-190 (2012)