Yelmewad, P., & Talawar, B. (2021). Parallel version of local search heuristic algorithm to solve capacitated vehicle routing problem. Cluster Computing. https://doi.org/10.1007/s10586-021-03354-9
Yelmewad, P., & Talawar, B. (2020b). Parallel deterministic local search heuristic for minimum latency problem. Cluster Computing, 24(2), 969–995. https://doi.org/10.1007/s10586-020-03173-4
Yelmewad, P., & Talawar, B. (2018b). Parallel iterative hill climbing algorithm to solve tsp on GPU. Concurrency and Computation: Practice and Experience, 31(7), e4974. https://doi.org/10.1002/cpe.4974
Yelmewad, P., & Talawar, B. (2020a). Gpu-based parallel heuristics for capacited vehicle routing problem, In 2020 ieee international conference on electronics, computing and communication technologies(conecct). https://doi.org/https://doi.org/10.1109/CONECCT50063.2020.9198667
Yelmewad, P., Kumar, A., & Talawar, B. (2019). MMAS on GPU for large TSP instances, In 10th international conference on computing, communication and networking technologies, ICCCNT 2019, IIT Kanpur, india, july 6-8, 2019, IEEE. https://doi.org/10.1109/ICCCNT45670.2019.8944770
Yelmewad, P., & Talawar, B. (2018a). Near optimal solution for traveling salesman problem using gpu, In 2018 ieee international conference on electronics, computing and communication technologies(conecct). https://doi.org/10.1109/CONECCT.2018.8482363
Talawar, B., & Yelmewad, P. (2017). Gpu-based iterative hill climbing algorithm to solve symmetric traveling salesman problem (L. Grandinetti, S. L. Mirtaheri, R. Shahbazian, T. L. Sterling, & V. V. Voevodin, Eds.). In L. Grandinetti, S. L. Mirtaheri, R. Shahbazian, T. L. Sterling, & V. V. Voevodin (Eds.), Big data and HPC: ecosystem and convergence, tophpc 2017, tehran, iran, 24-26 april 2017. IOS Press. https://doi.org/10.3233/978-1-61499-882-2-221