Integer programming based solution approaches for the train dispatching problem

Railroads face the challenge of competing with the trucking industry in a fastpaced environment. In this respect, they are working toward running freight trains on schedule and reducing travel times. The planned train schedules consist of departure and arrival times at main stations on the rail network. A detailed timetable, on the other hand, consists of the departure and arrival times of each train in each track section of its route. The train dispatching problem aims to determine detailed timetables over a rail network in order to minimize deviations from the planned schedule. We provide a new integer programming formulation for this problem based on a spacetime network; we propose heuristic algorithms to solve it and present computational results of these algorithms. Our approach includes some realistic constraints that have not been previously considered as well as all the assumptions and practical issues considered by the earlier works

Cylindrical thin-shell wormholes and energy conditions

We prove the impossibility of cylindrical thin-shell wormholes supported by matter satisfying the energy conditions everywhere, under reasonable assumptions about the asymptotic behaviour of the - in general different - metrics at each side of the throat. In particular, we reproduce for singular sources previous results corresponding to flat and conical asymptotics, and extend them to a more general asymptotic behaviour. Besides, we establish necessary conditions for the possibility of non exotic cylindrical thin-shell wormholes.Comment: 9 pages; slightly improved version of the article accepted in Int. J. Mod. Phys.

Topological qubits in graphenelike systems

The fermion-doubling problem can be an obstacle to getting half-a-qubit in two-dimensional fermionic tight-binding models in the form of Majorana zero modes bound to the core of superconducting vortices. We argue that the number of such Majorana zero modes is determined by a Z_2 x Z_2 topological charge for a family of two-dimensional fermionic tight-binding models ranging from noncentrosymmetric materials to graphene. This charge depends on the dimension of the representation (i.e., the number of species of Dirac fermions -- where the doubling problem enters) and the parity of the Chern number induced by breaking time-reversal symmetry. We show that in graphene there are as many as ten order parameters that can be used in groups of four to change the topological number from even to odd.Comment: 5 pages; 2 figures; 1 tabl

Irrelevance of information outflow in opinion dynamics models

The Sznajd model for opinion dynamics has attracted a large interest as a simple realization of the psychological principle of social validation. As its most salient feature, it has been claimed that the Sznajd model is qualitatively different from other ordering processes, because it is the only one featuring outflow of information as opposed to inflow. We show that this claim is unfounded by presenting a generalized zero-temperature Glauber-type of dynamics which yields results indistinguishable from those of the Sznajd model. In one-dimension we also derive an exact expression for the exit probability of the Sznajd model, that turns out to coincide with the result of an analytical approach based on the Kirkwood approximation. This observation raises interesting questions about the applicability and limitations of this approach.Comment: 5 pages, 4 figure