From post

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.

 

Другие публикации лиц с тем же именем

Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach., и . Optim. Lett., 16 (8): 2313-2331 (2022)A Memetic Algorithm for the Network Construction Problem with Due Dates., , и . ISDA, том 736 из Advances in Intelligent Systems and Computing, стр. 209-220. Springer, (2017)A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem., , , и . ICVNS, том 12010 из Lecture Notes in Computer Science, стр. 53-66. Springer, (2019)A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem., , , , и . J. Heuristics, 27 (3): 267-301 (2021)An Effective Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stack and Heterogeneous Demand., и . ISDA, том 736 из Advances in Intelligent Systems and Computing, стр. 785-796. Springer, (2017)A Variable Neighborhood Search Algorithm for the Long-term Preventive Maintenance Scheduling Problem., , и . ICEIS (1), стр. 303-310. SciTePress, (2018)A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm for the Bi-Objective Traveling Thief Problem., , , , и . CoRR, (2020)A Branch-and-Price Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand., и . ISDA, том 557 из Advances in Intelligent Systems and Computing, стр. 921-934. Springer, (2016)Ants can orienteer a thief in their robbery., и . Oper. Res. Lett., 48 (6): 708-714 (2020)A Mixed-Integer Linear Programming Model and a Simulated Annealing Algorithm for the Long-Term Preventive Maintenance Scheduling Problem., , и . ISDA, том 736 из Advances in Intelligent Systems and Computing, стр. 144-153. Springer, (2017)