Quantum optical ramsey fringes and complementarity

An interferometer in which an atom traverses two identical micromaser cavities in succession is proposed. Depending on the preparation of the cavity fields, the probability for finding the atom in a definite final state displays Ramsey fringes or not. If the initial cavity fields are such that the state of the atom between the cavities can be determined, then the Ramsey fringes disappear, as is required by the principle of complementarity.     

Symmetries of Integrable Difference Equations on the Quad-Graph

This paper describes symmetries of all integrable difference equations that belong to the famous Adler–Bobenko–Suris classification. For each equation, the characteristics of symmetries satisfy a functional equation, which we solve by reducing it to a system of partial differential equations. In this way, all five-point symmetries of integrable equations on the quad-graph are found. These include mastersymmetries, which allow one to construct infinite hierarchies of local symmetries. We also demonstrate a connection between the symmetries of quad-graph equations and those of the corresponding Toda type difference equations.     

Trace norm estimates for products of integral operators and diffusion semigroups

We give trace norm estimates for products of integral operators and for diffusion semigroups. These are applied to differences of heat semigroups. A natural example of an integral operator with finite trace which is not trace class is given.     

Improved modeling and solution methods for the multi-resource routing problem

This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies.