Author of the publication

An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading.

, , and . INFOR Inf. Syst. Oper. Res., 45 (4): 223-238 (2007)

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

Minimum Weighted Feedback Vertex Set on Diamonds., , , and . CTW, page 81-85. (2004)A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem., , , and . INOC, volume 6701 of Lecture Notes in Computer Science, page 589-602. Springer, (2011)An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading., , and . INFOR Inf. Syst. Oper. Res., 45 (4): 223-238 (2007)The maximum labeled clique problem., , and . CTW, page 146-149. (2011)A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs., and . Networks, 78 (1): 32-45 (2021)A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds., , , and . Inf. Process. Lett., 94 (1): 29-35 (2005)A Tabu Search Approach for the Circle Packing Problem., , and . NBiS, page 165-171. IEEE Computer Society, (2014)Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP., , , , and . Comput. Oper. Res., (2024)A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem., , and . EURO J. Comput. Optim., (2024)A two-level metaheuristic for the all colors shortest path problem., , , and . Comput. Optim. Appl., 71 (2): 525-551 (2018)