Hoang Thanh Le
Orcid: 0000-0003-3963-0467Affiliations:
- University of Leipzig, Germany
According to our database1,
Hoang Thanh Le
authored at least 9 papers
between 2016 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
XF-OPT/META: A Hyperparameter Optimization Framework Applied to the H -SPPBO Metaheuristic for the Dynamic TSP.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2023
2022
Two-Stage Vehicle Routing Problems with Profits and Buffers: Analysis and Metaheuristic Optimization Algorithms
PhD thesis, 2022
An Improvement Heuristic Based on Variable Neighborhood Search for Dynamic Orienteering Problems with Changing Node Values and Changing Budgets.
SN Comput. Sci., 2022
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine.
Eur. J. Oper. Res., 2022
2021
Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine.
Evol. Comput., 2021
A Hierarchical Simple Probabilistic Population-Based Algorithm Applied to the Dynamic TSP.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2021
An Improvement Heuristic Based on Variable Neighborhood Search for a Dynamic Orienteering Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2021
2019
An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2019
2016
A learning algorithm based on $λ$-policy iteration and its application to the video game "tetris attack".
Proceedings of the 46. Jahrestagung der Gesellschaft für Informatik, 2016