Author of the publication

Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem.

, , and . Transp. Sci., 48 (1): 46-58 (2014)

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 algorithm for the hierarchical Chinese postman problem., and . Oper. Res. Lett., 26 (1): 27-32 (2000)Parallel tabu search for a pickup and delivery problem under track contention., , , and . Parallel Comput., 29 (5): 631-639 (2003)A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem., , and . Transp. Sci., 46 (3): 374-387 (2012)Ejection chain moves for automatic neighborhood synthesis in constrained cardinality-minimization problems., , , and . ITOR, 27 (2): 1210-1235 (2020)A lower bound for the quickest path problem., and . Comput. Oper. Res., (2014)MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration., , , , and . Comput. Oper. Res., (2017)Model-based automatic neighborhood design by unsupervised learning., , and . Comput. Oper. Res., (2015)Extracting Semantic Roles from Ungrammatical Sentences., , and . IntelliSys (2), volume 869 of Advances in Intelligent Systems and Computing, page 1223-1228. Springer, (2018)Time-dependent routing problems: A review., , and . Comput. Oper. Res., (2015)An enhanced lower bound for the Time-Dependent Travelling Salesman Problem., , and . Comput. Oper. Res., (2020)