Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem. - Víctor Hugo Pacheco-Valencia; José Alberto Hernández 002; José María Sigarreta; Nodari Vakhania (Algorithms, 2020)

A Multi-Phase Method for Euclidean Traveling Salesman Problems. - Víctor Hugo Pacheco-Valencia; Nodari Vakhania; Frank Angel Hernández Mira; José Alberto Hernández Aguilar (Axioms, 2022)

Simulated Annealing Metaheuristic Approach for Municipal Solid Waste Collecting Route Problem in the Historical Center of a Mexican City. - Ivonne Yazmín Arce-García; Pedro Moreno-Bernal; Víctor Pacheco-Valencia; Maria del Carmen Torres-Salazar; Sergio Nesmachnow; Viridiana Aydeé León-Hernández (ICSC-Cities, 2023)

Harnessing Computer Science to Drive Sustainable Supply Chains Facing Resilience Organizational Complexity. - Pablo Guerrero-Sánchez; Belem Hernández-Jaimes; José Guerrero-Grajeda; Víctor Hugo Pacheco-Valencia; Rosa Álvarez-González; Felipe Bonilla-Sánchez (ICSC-Cities, 2023)

Implementation of a Hybrid Tabu Search Algorithm for Solving the Capacitated Vehicle Routing Problem. - Carlos Condado-Huerta; José Alberto Hernández Aguilar; Martín Heriberto Cruz-Rosales; Víctor Pacheco-Valencia; Julio César Ponce Gallegos (MICAI (Workshops 1), 2024)

An Algorithm for the Euclidean Bounded Multiple Traveling Salesman Problem. - Víctor Pacheco-Valencia; Nodari Vakhania (CoRR, 2024)

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability. - Nodari Vakhania; Frank Werner 001; Kevin Johedan Ramírez-Fuentes; Víctor Pacheco-Valencia (CoRR, 2024)

Implementation of a Hybrid Tabu Search Algorithm with Local Search for Solving the Capacitated Vehicle Routing Problem. - José Alberto Hernández Aguilar; Víctor Pacheco-Valencia; Martín Heriberto Cruz-Rosales; Julio César Ponce Gallegos; Carlos Condado-Huerta (Int. J. Comb. Optim. Probl. Informatics, 2025)