We consider multi-antenna base stations using orthogonal frequency-division multiple access and space division multiple access techniques to serve single-a...

In this article, we provide an analytical framework to assess network level QoS measures for differentiated non-saturated traffic in infrastructure mode 802....

This paper analyzes the impact of feedback delay on the performance of multiuser selection diversity systems employing orthogonal space-time block coding (OS...

The paper addresses the optimal production control problems for an unreliable manufacturing system that produces items that can be regarded as conforming or ...

This paper presents the application of a new approach, territorial intelligence modelling for energy development (TIMED), developed in response to growing ...

The large-scale (more than 25MW) development of wind energy seems to be a very promising option given climate change and the need to diversify sources of ene...

In this paper we introduce the discrete time window assignment vehicle routing problem. This problem consists of assigning a single time window from a ...

In this paper a new procedure for finding an upper bound on the clique number of a given graph is described. Gendron, Hertz and St-Louis (2008) proposed a se...

We derive conditions on the functions \(\varphi\), \(\rho\), \(v\) and \(w\) such that the 0-1 fractional programming problem`(\max\limits_{x\in {0...

In this paper, we study the problem introduced by Baptiste et al. (2011) of minimizing the number of steps to unload a set of boxes off a gravity conveyor. W...

Given a directed graph with weights on the vertices and on the arcs, a &theta;-improper <i>k</i>-coloring is an assignment of at most <i>k</i> different colo...

Given a graph <i>G</i>, an integer <i>k</i>, and a cost <i>c_uv</i> associated with all pairs <i>uv</i> of non-adjacent vertices in <i>G</i>, the ...

The BIRCH algorithm (Balanced Iterative Reducing and Clustering Hierarchies) handles massive dataset by reading the data file only once, clustering the data ...

This paper addresses the NP hard optimization problem of packing identical spheres of unit radii into the smallest sphere (PSS). It models PSS as a non-li...

This paper studies the pricing strategies of firms belonging to a vertical channel structure where optional contingent products are sold. Optional continge...

The purpose of this paper is to study the periodic arc routing problem when the arcs of a network behave as customers, and sufficient material is delivered s...

In many situations, such as art auctions, privatization of public assets and allocation of television airwaves to wireless carriers, the value of the objec...

In this paper, for the purpose of service differentiation in opportunistic spectrum access (OSA) enabled networks, we take different priority queueing discip...

We consider a two-player differential game of international emissions to represent the interactions between two groups of countries, namely, developed and ...

Interior-point methods feature prominently among numerical methods for inequality-constrained optimization problems, and involve the need to solve a sequ...