In this work we address the facility network restructuring problem. This problem is closely related to location/allocation and set covering problems. However, none of the above includes all its complexity nor involves all the decision types. Due to the presence of economies of scale, another...

In this work we address investment decisions using real options. A standard numerical approach for valuing real options is dynamic programming. The basic idea is to establish a discrete-valued lattice of possible future values of the underlying stochastic variable (demand in our case). For most...

In this work, we address an investment problem where the investment can either be made immediately or postponed to a later time, in the hope that market conditions become more favourable. In our case, uncertainty is introduced through market price. When the investment is undertaken, a fixed sunk...

In this work, we address the problem of finding a minimum cost spanning tree on a single source flow network. The tree must span all vertices in the given network and satisfy customer demands at a minimum cost. The total cost is given by the summation of the arc setup costs and of the nonlinear...

Multi-criteria decision analysis (MCDA) has been one of the fastest-growing areas of operations research during the last decades. The academic attention devoted to MCDA motivated the development of a great variety of approaches and methods within the field. These methods distinguish themselves...

This paper presents a computational study of global characteristics of the US stock market using a network-based model referred to as the market graph. The market graph reflects similarity patterns between stock return fluctuations via linking pairs of stocks that exhibit “coordinated”...

Given a simple undirected graph, the problem of finding a maximum subset of vertices satisfying a nontrivial, interesting property Π that is hereditary on induced subgraphs, is known to be NP-hard. Many well-known graph properties meet the above conditions, making the problem widely applicable....

A connected dominating set (CDS) is commonly used to model a virtual backbone of a wireless network. To bound the distance that information must travel through the network, we explicitly restrict the diameter of a CDS to be no more than s leading to the concept of a dominating s-club. We prove...