The Combinatorial bandwidth packing problem (CBPP), arising in a telecommunication network with limited bandwidth, is defined as: given a set of request, each with its potential revenue and consisting of calls with their bandwidth requirements, deciding (i) a subset of the requests to...

Hub-and-spoke systems have wide applications ranging in airline transportation, freight transportation, urban traffic, postal delivery, telecommunications and distribution in supply chains. These systems are usually characterized by stochastic demand and congestion, which adversely affect the...

The bandwidth packing problem seeks to select and route a set of calls from a given list, each with a pre-specified requirement for bandwidth, on an undirected communication network such that the revenue generated is maximized. In this paper, we present a model and an exact solution approach for...

We consider a class of location-allocation problems with immobile servers, stochastic demand and congestion that arises in several planning contexts: location of emergency medical clinics; preventive healthcare centers; refuse collection and disposal centers; stores and service centers; bank...