Nodari Vakhania

According to our database, Nodari Vakhania authored at least 38 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Approximating a Minimum Dominating Set by Purification.

Ernesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, José Alberto Hernández Aguilar

Algorithms, June, 2024

Exact and heuristic algorithms for the domination problem.

Ernesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, Frank Angel Hernández Mira

Eur. J. Oper. Res., March, 2024

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability.

Nodari Vakhania, Frank Werner, Kevin Johedan Ramírez-Fuentes, Víctor Pacheco-Valencia

CoRR, 2024

An Algorithm for the Euclidean Bounded Multiple Traveling Salesman Problem.

Víctor Pacheco-Valencia, Nodari Vakhania

CoRR, 2024

Reducing Dominating Sets in Graphs.

Ernesto Parra Inza, José María Sigarreta Almira, Nodari Vakhania

CoRR, 2024

2023

On the complexity of scheduling unrelated parallel machines with limited preemptions.

Jan Karel Lenstra, Nodari Vakhania

Oper. Res. Lett., March, 2023

Algorithms for the Global Domination Problem.

Ernesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, Frank Angel Hernández Mira

CoRR, 2023

2022

A polynomial-time approximation to a minimum dominating set in a graph.

Frank Angel Hernández Mira, Ernesto Parra Inza, José M. Sigarreta Almira, Nodari Vakhania

Theor. Comput. Sci., 2022

Exact and Approximation Algorithms for the Domination Problem.

Ernesto Parra Inza, Frank Angel Hernández Mira, José María Sigarreta Almira, Nodari Vakhania

CoRR, 2022

Variable Parameter Analysis for Scheduling One Machine.

Nodari Vakhania

CoRR, 2022

A polynomial-time approximation to a minimum dominating set in a graph.

Frank Hernandez, Ernesto Parra, José María Sigarreta, Nodari Vakhania

CoRR, 2022

On Preemptive Scheduling of Unrelated Machines Using Linear Programming.

Nodari Vakhania

CoRR, 2022

Scheduling a single machine with compressible jobs to minimize maximum lateness.

Nodari Vakhania, Frank Werner, Alejandro Reynoso

CoRR, 2022

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

2021

Theoretical and practical issues in single-machine scheduling with two job release and delivery times.

Alejandro Reynoso, Nodari Vakhania

J. Sched., 2021

Compact enumeration for scheduling one machine.

Nodari Vakhania

CoRR, 2021

2020

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, José María Sigarreta, Nodari Vakhania

Algorithms, 2020

2019

Fast solution of single-machine scheduling problem with embedded jobs.

Nodari Vakhania

Theor. Comput. Sci., 2019

2018

Scheduling a Single Machine with Primary and Secondary Objectives.

Nodari Vakhania

Algorithms, 2018

2013

Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time.

Nodari Vakhania, Frank Werner

Theor. Comput. Sci., 2013

A study of single-machine scheduling problem to maximize throughput.

Nodari Vakhania

J. Sched., 2013

2012

Branch less, cut more and minimize the number of late equal-length jobs on identical machines.

Nodari Vakhania

Theor. Comput. Sci., 2012

2011

A note on the proof of the complexity of the little-preemptive open-shop problem.

Evgeny V. Shchepin, Nodari Vakhania

Ann. Oper. Res., 2011

2009

Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs.

Nodari Vakhania

Oper. Res. Lett., 2009

2008

On the geometry, preemptions and complexity of multiprocessor and shop scheduling.

Evgeny V. Shchepin, Nodari Vakhania

Ann. Oper. Res., 2008

2007

Global Estimations for Multiprocessor Job-Shop.

Nodari Vakhania

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2005

An optimal rounding gives a better approximation for scheduling unrelated machines.

Evgeny V. Shchepin, Nodari Vakhania

Oper. Res. Lett., 2005

2004

Preemptive scheduling of equal-length jobs to maximize weighted throughput.

Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania

Oper. Res. Lett., 2004

Single-Machine Scheduling with Release Times and Tails.

Nodari Vakhania

Ann. Oper. Res., 2004

2003

Preemptive scheduling in overloaded systems.

Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania

J. Comput. Syst. Sci., 2003

A better algorithm for sequencing with release and delivery times on identical machines.

Nodari Vakhania

J. Algorithms, 2003

2002

Little-Preemptive Scheduling on Unrelated Processors.

Evgeny V. Shchepin, Nodari Vakhania

J. Math. Model. Algorithms, 2002

Scheduling Equal-Length Jobs with Delivery times on Identical Processors.

Nodari Vakhania

Int. J. Comput. Math., 2002

2001

Tight Performance Bounds of CP-Scheduling on Out-Trees.

Nodari Vakhania

J. Comb. Optim., 2001

2000

Global and Local Search for Scheduling Job Shop with Parallel Machines.

Nodari Vakhania

Proceedings of the Advances in Artificial Intelligence, 2000

Task Distributions on Multiprocessor Systems.

Evgeny V. Shchepin, Nodari Vakhania

Proceedings of the Theoretical Computer Science, 2000

Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine.

Marjan van den Akker, Han Hoogeveen, Nodari Vakhania

Proceedings of the Algorithms, 2000

1997

Sequencing jobs with readiness times and tails on parallel machines.

Nodari Vakhania

Proceedings of the 1997 ACM symposium on Applied Computing, 1997