Roman Kutelmakh

According to our database, Roman Kutelmakh authored at least 5 papers between 2007 and 2023.

Collaborative distances:

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

2023

Solving Large Scale Uniform Traveling Salesman Problem by Using Partial Solution Expansion Method.

Roman Kutelmakh, Roman P. Bazylevych, Bhanu Prasad

Proceedings of the 18th IEEE International Conference on Computer Science and Information Technologies, 2023

2011

A Parallel Approach for Solving a Large-Scale Traveling Salesman Problem.

Roman P. Bazylevych, Rémy Dupas, Bhanu Prasad, Bohdan Kuz, Roman Kutelmakh, Lubov Bazylevych

Proceedings of the 5th Indian International Conference on Artificial Intelligence, 2011

2009

A Decomposition Algorithm for Uniform Traveling Salesman Problem.

Roman P. Bazylevych, Bhanu Prasad, Roman Kutelmakh, Rémy Dupas, Lubov Bazylevych

Proceedings of the 4th Indian International Conference on Artificial Intelligence, 2009

2008

Decomposition and Scanning Optimization Algorithms for TSP.

Roman P. Bazylevych, Bhanu Prasad, Roman Kutelmakh, Lubov Bazylevych

Proceedings of the International Conference on Theoretical and Mathematical Foundations of Computer Science, 2008

2007

Decomposition Algorithms for Large-scale Clustered TSP.

Roman P. Bazylevych, Roman Kutelmakh, Rémy Dupas, Lubov Bazylevych

Proceedings of the 3rd Indian International Conference on Artificial Intelligence, 2007