Author of the publication

Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs.

, , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 458-467. Springer, (2004)

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

Biased Ranom-Key Genetic Algorithms: An Advanced Tutorial., and . GECCO (Companion), page 483-514. ACM, (2016)Query Optimization in Distributed Relational Databases., , and . J. Heuristics, 3 (1): 5-23 (1997)Multi-start methods for combinatorial optimization., , and . Eur. J. Oper. Res., 226 (1): 1-8 (2013)Greedy randomized adaptive search procedures for the Steiner problem in graphs., , , and . Randomization Methods in Algorithm Design, volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 133-145. DIMACS/AMS, (1997)Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem., , and . Electron. Notes Discret. Math., (2008)An exact algorithm for the maximum quasi-clique problem., and . Int. Trans. Oper. Res., 26 (6): 2199-2229 (2019)Celebrating 30 years of International Transactions in Operational Research., and . Int. Trans. Oper. Res., 30 (4): 1583-1588 (July 2023)A biased random-key genetic algorithm for the chordal completion problem., , and . RAIRO Oper. Res., 57 (3): 1559-1578 (May 2023)A GRASP for graph planarization., and . Networks, 29 (3): 173-189 (1997)New heuristics and integer programming formulations for scheduling divisible load tasks., and . CISched, page 54-61. IEEE, (2009)