ASTRONOMY AND ASTROPHYSICS ROSAT archival observations of 1SAX J0054.9–7226 = 2E 0053.2–7242, a newly discovered X–ray pulsar in the SMC Abstract. We analysed 13 archival ROSAT PSPC and HRI observations which included the position of a newly discovered 59 s X–ray pulsar in the Small Magellanic Cloud, 1SAX J0054.9–7226 = 2E 0053.2–7242. The source was detected three times between 1991 and 1996 a...

The Youla parameterization (also the Q – parametrization) is a modern control design method suitable for both stable and unstable plants. In the design phase systems with electrical drives can be well approximated through low order linear models called benchmarks. For such system it can be advantageous to use control design based on modulus optimum criterion (Modulus Optimum MO-m and Symmetrica...

In the two-echelon vehicle routing problem (2E-VRP), distribution network is split into two echelons. Different vehicles are operated on first and second echelon to maintain economies of scale adhere any restrictions that may be present in either echelon. Intermediate facilities located at borders echelons facilitate consolidation transshipment goods between Examples systems include express del...

We have fabricated single-Cooper-pair transistors in which the spatial profile of the superconducting gap energy was controlled by oxygen doping. The profile dramatically affects the switching current vs gate voltage curve of the transistor, changing its period from 1e to 2e. A model based on nonequilibrium quasiparticles in the leads explains our results, including the observation that even de...

The Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) where customers may be assigned to multiple routes. A new construction heuristic is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. With respect to the total travel distance, the construction heuristic compares favora...

We propose an abstraction of emerging vehicle routing problems, the VRP with Black Box Feasibility. In this problem the routes of a basic VRP need to satisfy an unknown set of constraints. A black box function to test the feasibility of a route is provided. Practical examples of such problems are combinations of VRP with Loading or VRP with Scheduling. We propose a heuristic column generation-b...

This paper concerns the Split Delivery Vehicle Routing Problem (SDVRP). This problem is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) since the customers’ demands are allowed to be split. We deal with the cases where the fleet is unlimited (SDVRP-UF) and limited (SDVRP-LF). In order to solve them, we implemented a multi-start Iterated Local Search (ILS) based heuristic that inc...