János Barta

Learn More
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)
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)
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)
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)
  • 1