The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin–destination pair. In the extensive literature on this challenging network design problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Relaxation of this basic assumption ...

We consider a supply chain in which a single supplier with fixed capacity sells to several independent retailers or manufacturers. The retailers have private information about their individual markets (e.g., mean market demand), which influences the size of their orders to the supplier. If the sum of all retailer orders exceeds the supplier’s capacity, the supplier uses a pre-declared rule, whi...

the market for carbon dioxide rights emerged as one of the tools applicable to the implementation of the measures adopted by the kyoto protocol to combat climate change. in this paper we analyze the case of spain, because their peculiar administrative division into seventeen autonomous communities, it is relevant to a detailed study of emissions and allowances of the industries that make up ...

We introduce a new class of problems that contains two existing classes: allocation problems with single-peaked preferences and bankruptcy problems. On this class, we analyze the implications of well-known properties such as Pareto optimality, strategy-proofness, resource-monotonicity, no-envy, equal treatment of equals, and two new properties we introduce, hierarchical no-envy and independence...

This paper discusses the fixed-hub single allocation problem (FHSAP). In this problem, a network consists of hub nodes and terminal nodes. Hubs are fixed and fully connected; each terminal node is connected to a single hub which routes all its traffic. The goal is to minimize the cost of routing the traffic in the network. In this paper, we propose a linear programming (LP)-based rounding algor...

In contrast to p-hub problems with a summation objective (p-hub median), minmax hub problems (p-hub center) have not attained much attention in the literature. In this paper, we give a polyhedral analysis of the uncapacitated single allocation p-hub center problem (USApHCP). The analysis will be based on a radius formulation which currently yields the most efficient solution procedures. We show...

The Group Allocation Multiple Access (GAMA) protocol for scheduling variable-length packet transmissions in a single-hop packet-radio network is specified and analyzed. By maintaining a dynamically-sized cycle that changes in length depending on the amount of network traffic, GAMA is able to provide the advantages of both TDMA and CSMA. Each cycle contains a contention period and a group-transm...

The mapping of application functionality onto multiple multithreaded processing elements of a high performance embedded system is currently a slow and arduous task for application developers. Previous attempts at automation have either ignored hardware support for multithreading and focused on scheduling, or have overlooked the architectural peculiarities of these systems. This work attempts to...

This thesis studies task allocation in multi-robot teams operating in dynamic environments. The multi-robot task allocation problem is a complex NP-Complete optimisation problem with globally optimal solutions often difficult to find. Because of this, the rapid generation of near optimal solutions to the problem that minimise task execution time and/or energy used by robots is highly desired. O...

The design of hub-and-spoke transport networks is a strategic planning problem, as the choice of hub locations has to remain unchanged for long time periods. However, strikes, disasters or traffic breakdown can lead to the unavailability of a hub for a short period of time. Therefore it is important to consider such events already in the planning phase, so that a proper reaction is possible; on...