János Barta

According to our database, János Barta authored at least 8 papers between 2007 and 2025.

Collaborative distances:

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

2025

The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+6 Non-zero Components.

Tullio Villa, Eleonora Vercesi, János Barta, Monaldo Mastrolilli

CoRR, July, 2025

On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach.

Eleonora Vercesi, János Barta, Luca Maria Gambardella, Stefano Gualandi, Monaldo Mastrolilli

Discret. Optim., 2025

2022

The Maximum Clique Problem for Permutation Hamming Graphs.

János Barta, Roberto Montemanni

J. Optim. Theory Appl., 2022

2016

Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms.

Roberto Montemanni, János Barta, Derek H. Smith

Proceedings of the New Advances in Information Systems and Technologies, 2016

2012

Statistical modelling of delays in a rail freight transportation network.

János Barta, Andrea Emilio Rizzoli, Matteo Salani, Luca Maria Gambardella

Proceedings of the Winter Simulation Conference, 2012

2011

Minimum power multicasting in wireless networks under probabilistic node failures.

János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki

Comput. Optim. Appl., 2011

2010

Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem.

János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki

Electron. Notes Discret. Math., 2010

2007

The Robust Traveling Salesman Problem with Interval Data.

Roberto Montemanni, János Barta, Monaldo Mastrolilli, Luca Maria Gambardella

Transp. Sci., 2007