2 papers
cs.DS2024
An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability
Nodari Vakhania, Frank Werner, Kevin Johedan RamÃrez-Fuentes +1
Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems appeared. They addressed many heuristics…
cs.DM2024
An Algorithm for the Euclidean Bounded Multiple Traveling Salesman Problem
VÃctor Pacheco-Valencia, Nodari Vakhania
In the Bounded Multiple Traveling Salesman Problem (BMTSP), a tour for each salesman, that starts and ends at the depot and that respects the bounds on the number of cities that a…