In the median cycle problem the aim is to determine a simple cycle through a subset of vertices of a graph involving two types of costs: a routing cost associated with the cycle itself, and the cost of assigning vertices not on the cycle to visited vertices. The objective is to minimize the routing cost, subject to an upper bound on the total assignment cost. This problem arises in the location...

A common behavioral assumption in the study of transportation and telecommunication networks is that travelers or packets, respectively, choose routes that they perceive as being the shortest under the prevailing traffic conditions [1]. The situation resulting from these individual decisions is one in which drivers cannot reduce their journey times by unilaterally choosing another route, which ...

Facility location problems are often encountered in many areas such as distribution, transportation and telecommunication. We describe a new solution approach for the capacitated facility location problem in which each customer is served by a single facility. An important class of heuristic solution methods for these problems are Lagrangian heuristics which have been shown to produce high quali...

Recursive queries are required in many object-oriented database applications. Among them we can mention Bill-Of-Material (BOM), various kinds of networks (transportation, telecommunication, etc.), processing semistructured data (XML, RDF), and so on. The support for recursive queries in current query languages is limited and lacks theoretical foundations. In this paper we present recursive quer...

We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the elds of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets for this polyhedron. We develop a general rule about lifting facets from the uncapac...

We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polyn...

The intelligent transportation systems (ITS) framework from European Telecommunication Standards Institute (ETSI) imposes requirements on the exchange of periodic safety messages between components of ITS such as vehicles. In particular, it requires ETSI standardized Decentralized Congestion Control (DCC) algorithm to regulate the beaconing activity of vehicles based on wireless channel utiliza...

In the Colorful Traveling Salesman Problem (CTSP), given a graph G with a (not necessarily distinct) label (color) assigned to each edge, a Hamiltonian tour with the minimum number of different labels is sought. The problem is a variant of the well-known Hamiltonian Cycle problem and has potential applications in telecommunication networks, optical networks, and multimodal transportation networ...

Random vibration analysis of tall structures faces multiple problems due to the large number of elements and high degrees of freedom; that is why this type of analysis is mostly used in simple structures and low degrees of freedom. In the past two decades, changes have been occurred in this type of analysis to be used in complex structures and the large number of elements. Pseudo-Excitation Met...

The creation of specific organisations or programs for developing or overseeing the development of Spatial Data Infrastructures, particularly by government at various levels, can be seen as the logical extension of a long practice police oriented to co-ordinate the building of other necessary infrastructures for ongoing development such as transportation or telecommunication networks. This kind...