8 citations · 18 across the 10 of their papers we have counts for
11 papers
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…
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…
Reducing Dominating Sets in Graphs
Ernesto Parra Inza, José María Sigarreta Almira, Nodari Vakhania
A dominating set of a graph is a subset of vertices such that every vertex has at least one neighbor in set . The corresponding opti…
Algorithms for the Global Domination Problem
Ernesto Parra Inza, Nodari Vakhania, Jose M. Sigarreta Almira +1
A dominating set D in a graph G is a subset of its vertices such that every vertex of the graph which does not belong to set D is adjacent to at least one vertex from set D. A set…
Variable Parameter Analysis for Scheduling One Machine
Nodari Vakhania
In contrast to the fixed parameter analysis (FPA), in the variable parameter analysis (VPA) the value of the target problem parameter is not fixed, it rather depends on the structu…
Exact and Heuristic Algorithms for the Domination Problem
Ernesto Parra Inza, Frank Angel Hernández Mira, José María Sigarreta Almira +1
In a simple connected graph , a subset of vertices is a dominating set if any vertex is adjacent to some vertex from this subset.…