#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2006

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Roberto Montemanni, János Barta, Monaldo Mastrolilli, Luca Maria Gambardella
- Transportation Science
- 2007

The traveling salesman problem is one of the most famous combina-torial optimization problems, and has been intensively studied in the last decades. Many extensions to the basic problem have been also proposed, with the aim of making the resulting mathematical models as much realistic as possible. We present a new extension to the basic problem, where… (More)

We study a version of the traveling salesman problem where travel times are specified as a range of possible values. This model reflects the difficulties to estimate travel times exactly in reality. Robustness concepts are used to drive optimization. We propose some efficient heuristic and preprocessing techniques. Computational experiments are presented.

- János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki
- Comp. Opt. and Appl.
- 2011

land (SUPSI), and was founded in 1988 by the Dalle Molle Foundation which promoted quality of life. Abstract In this paper we deal with a new probabilistic extension of the Minimum Power Multi-cast (MPM) problem for wireless networks. The deterministic MPM problem consists in assigning transmission powers to the nodes, so that a multihop connection can be… (More)

- János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki
- Electronic Notes in Discrete Mathematics
- 2010

In this paper we describe some results on the linear integer programming formulation of the Probabilistic Minimum Power Multicast (PMPM) problem for wireless networks. The PMPM problem consists in optimally assigning transmission powers to the nodes of a given network in order to establish a multihop connection between a source node and a set of destination… (More)

- Janos Barta, Roberto Montemanni, Derek H. Smith
- 2014 2nd International Conference on Information…
- 2014

The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in coding theory. The aim is to generate the largest possible permutation codes, having a given length n and a minimum Hamming distance d between the codewords. In this paper we present a new branch and bound algorithm, which combines combinatorial techniques with… (More)

- János Barta, Andrea Emilio Rizzoli, Matteo Salani, Luca Maria Gambardella
- Proceedings Title: Proceedings of the 2012 Winter…
- 2012

This study analyzes the transportation network of a major rail freight operator in order to obtain a model of delay propagation of trains connecting intermodal terminals. Operational management of a rail freight operator needs to take into account deviations due to unexpected events such as unplanned maintenance, strikes, railroad works, traffic congestion.… (More)

- Janos Barta, Roberto Montemanni, Derek H. Smith
- 2015 3rd International Conference on Information…
- 2015

This work presents an approach to the Maximum Permutation Code Problem (MPCP) that exploits the orbits of permutation groups in a new way. Several scientific works of recent years studied the principle of building feasible codes by combining the orbits of single permutation groups. However, the idea of combining orbits stemming from more than one group has… (More)

- Roberto Montemanni, János Barta, Derek H. Smith
- WorldCIST
- 2016

- ‹
- 1
- ›