4 citations · 4 across the 3 of their papers we have counts for
3 papers
Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
J. A. Alejandro-Soto, Carlos Segura, Joel Antonio Trejo-Sanchez
In this work, we use the matrix formulation of the Permutation Flowshop Scheduling Problem with makespan minimization to derive an upper bound and a general framework for obtaining…
A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs
J. A. Alejandro-Soto, Joel Antonio Trejo-Sanchez, Carlos Segura
This work proposes \textsc{H-Td}, a practical linear-time algorithm for computing an optimal-width tree decomposition of Halin graphs. Unlike state-of-the-art methods based on redu…
A greedy heuristic for graph burning
Jesús García-Díaz, José Alejandro Cornejo-Acosta, Joel Trejo Sánchez
Given a graph , the optimization version of the graph burning problem seeks for a sequence of vertices, , with minimum and such that every $v \…