Nodari Vakhania

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 19

Top Topics

Top Venues

Theor. Comput. Sci.

Oper. Res. Lett.

Publications

Víctor Pacheco-Valencia, Nodari Vakhania
An Algorithm for the Euclidean Bounded Multiple Traveling Salesman Problem. CoRR (2024)
Ernesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, José Alberto Hernández Aguilar
Approximating a Minimum Dominating Set by Purification. Algorithms 17 (6) (2024)
Nodari Vakhania, Frank Werner, Kevin Johedan Ramírez-Fuentes, Víctor Pacheco-Valencia
An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability. CoRR (2024)
Ernesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, Frank Angel Hernández Mira
Exact and heuristic algorithms for the domination problem. Eur. J. Oper. Res. 313 (3) (2024)
Ernesto Parra Inza, José María Sigarreta Almira, Nodari Vakhania
Reducing Dominating Sets in Graphs. CoRR (2024)
Ernesto Parra Inza, Nodari Vakhania, Jose M. Sigarreta Almira, Frank Angel Hernández Mira
Algorithms for the Global Domination Problem. CoRR (2023)
Jan Karel Lenstra, Nodari Vakhania
On the complexity of scheduling unrelated parallel machines with limited preemptions. Oper. Res. Lett. 51 (2) (2023)
Frank Angel Hernández Mira, Ernesto Parra Inza, José M. Sigarreta Almira, Nodari Vakhania
A polynomial-time approximation to a minimum dominating set in a graph. Theor. Comput. Sci. 930 (2022)
Nodari Vakhania
Variable Parameter Analysis for Scheduling One Machine. CoRR (2022)
Víctor Hugo Pacheco-Valencia, Nodari Vakhania, Frank Angel Hernández Mira, José Alberto Hernández Aguilar
A Multi-Phase Method for Euclidean Traveling Salesman Problems. Axioms 11 (9) (2022)
Nodari Vakhania, Frank Werner, Alejandro Reynoso
Scheduling a single machine with compressible jobs to minimize maximum lateness. CoRR (2022)
Ernesto Parra Inza, Frank Angel Hernández Mira, José María Sigarreta Almira, Nodari Vakhania
Exact and Approximation Algorithms for the Domination Problem. CoRR (2022)
Frank Hernandez, Ernesto Parra, José María Sigarreta, Nodari Vakhania
A polynomial-time approximation to a minimum dominating set in a graph. CoRR (2022)
Nodari Vakhania
On Preemptive Scheduling of Unrelated Machines Using Linear Programming. CoRR (2022)
Nodari Vakhania
Compact enumeration for scheduling one machine. CoRR (2021)
Alejandro Reynoso, Nodari Vakhania
Theoretical and practical issues in single-machine scheduling with two job release and delivery times. J. Sched. 24 (6) (2021)
Víctor Pacheco-Valencia, José Alberto Hernández, José María Sigarreta, Nodari Vakhania
Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem. Algorithms 13 (1) (2020)
Nodari Vakhania
Fast solution of single-machine scheduling problem with embedded jobs. Theor. Comput. Sci. 782 (2019)
Nodari Vakhania
Scheduling a Single Machine with Primary and Secondary Objectives. Algorithms 11 (6) (2018)
Nodari Vakhania
A study of single-machine scheduling problem to maximize throughput. J. Sched. 16 (4) (2013)
Nodari Vakhania, Frank Werner
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time. Theor. Comput. Sci. 501 (2013)
Nodari Vakhania
Branch less, cut more and minimize the number of late equal-length jobs on identical machines. Theor. Comput. Sci. 465 (2012)
Evgeny V. Shchepin, Nodari Vakhania
A note on the proof of the complexity of the little-preemptive open-shop problem. Ann. Oper. Res. 191 (1) (2011)
Nodari Vakhania
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs. Oper. Res. Lett. 37 (6) (2009)
Evgeny V. Shchepin, Nodari Vakhania
On the geometry, preemptions and complexity of multiprocessor and shop scheduling. Ann. Oper. Res. 159 (1) (2008)
Nodari Vakhania
Global Estimations for Multiprocessor Job-Shop. CISched (2007)
Evgeny V. Shchepin, Nodari Vakhania
An optimal rounding gives a better approximation for scheduling unrelated machines. Oper. Res. Lett. 33 (2) (2005)
Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
Preemptive scheduling of equal-length jobs to maximize weighted throughput. Oper. Res. Lett. 32 (3) (2004)
Nodari Vakhania
Single-Machine Scheduling with Release Times and Tails. Ann. Oper. Res. 129 (1-4) (2004)
Nodari Vakhania
A better algorithm for sequencing with release and delivery times on identical machines. J. Algorithms 48 (2) (2003)
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
Preemptive scheduling in overloaded systems. J. Comput. Syst. Sci. 67 (1) (2003)
Evgeny V. Shchepin, Nodari Vakhania
Little-Preemptive Scheduling on Unrelated Processors. J. Math. Model. Algorithms 1 (1) (2002)
Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput CoRR (2002)
Nodari Vakhania
Scheduling Equal-Length Jobs with Delivery times on Identical Processors. Int. J. Comput. Math. 79 (6) (2002)
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
Preemptive Scheduling in Overloaded Systems. ICALP (2002)
Nodari Vakhania
Tight Performance Bounds of CP-Scheduling on Out-Trees. J. Comb. Optim. 5 (4) (2001)
Evgeny V. Shchepin, Nodari Vakhania
Task Distributions on Multiprocessor Systems. IFIP TCS (2000)
Nodari Vakhania
Global and Local Search for Scheduling Job Shop with Parallel Machines. IBERAMIA-SBIA (2000)
Marjan van den Akker, Han Hoogeveen, Nodari Vakhania
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. ESA (2000)
Nodari Vakhania
Sequencing jobs with readiness times and tails on parallel machines. SAC (1997)