Author of the publication

Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem.

, , and . LION, volume 8994 of Lecture Notes in Computer Science, page 275-280. Springer, (2015)

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 Branch and Bound Algorithm for a Fractional 0-1 Programming Problem., , and . DOOR, volume 9869 of Lecture Notes in Computer Science, page 244-255. Springer, (2016)Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem., , and . LION, volume 8994 of Lecture Notes in Computer Science, page 275-280. Springer, (2015)An efficient exact model for the cell formation problem with a variable number of production cells., and . Comput. Oper. Res., (2018)A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse., , and . ITQM, volume 31 of Procedia Computer Science, page 773-777. Elsevier, (2014)Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries., and . MOD, volume 9432 of Lecture Notes in Computer Science, page 65-79. Springer, (2015)Initial Sorting of Vertices in the Maximum Clique Problem Reviewed., , and . LION, volume 8426 of Lecture Notes in Computer Science, page 111-120. Springer, (2014)Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem., and . IWOCA, volume 10979 of Lecture Notes in Computer Science, page 311-322. Springer, (2018)A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations., , , and . J. Comb. Optim., 31 (4): 1665-1677 (2016)Heuristic for a Real-life Truck and Trailer Routing Problem., and . ITQM, volume 31 of Procedia Computer Science, page 778-792. Elsevier, (2014)Vehicle assignment in site-dependent vehicle routing problems with split deliveries., , , and . Oper. Res., 21 (1): 399-423 (2021)