Stochastic programming can yield significant savings over deterministic approaches. For example, the stochastic approach for the shift scheduling problem sol...

Dispersion problems consist of the selection of a fixed number of vertices from a given set so that some function of the distances among the vertices is maxi...

Since the late forties of the last century, methods of operations research have been extensively used to solve problems in graph theory, and graph theory has...

This paper generalizes the notion of <i>set of</i> &#949;<i>-proper equilibria</i> to polymatrix games. We use 0-1 mixed quadratic and linear programming op...

This paper sets two alternate denitions of Perfect Nash Equilibria for Polymatrix Games. We present two linear programming formulations to identify perfect...

We study the stability and the stability index of the meet game form defined on a meet semilattice. Given any active coalition structure, we show that the s...

The paper answers an open problem introduced by Bezdek and Fodor in 2000. The width of any unit-diameter octagon is shown to be less than or equal to `(\fra...

Current network planning and design methods use the average delay, packet loss and throughput as metrics to optimize the network cost and performance. New...

In IP-over-WDM networks, protection can be offered at the optical layer or at the IP layer. Today, it is well acknowledged that synergies need to be develope...

We present ACRE, an Automatic aspeCt cREator, to use aspect-oriented programming to test multi-platform software programs written in C++. ACRE allows devel...

This paper develops a dynamic risk management model to determine a firm's optimal risk management strategy. This strategy has two elements: first, for low ...

In this paper a new branch-price-and-cut method for a maritime inventory routing problem for one of the world's largest producers of liquefied natural gas (L...

This paper presents the design, implementation, and the first experimental results of an architecture for autonomous demand-side load management (ADSM) syste...

A minimum equicut of an edge-weighted graph is a partition of the nodes of the graph into two sets of equal size such that the sum of the weights of ed...

In this article we study a network design problem that arises in the exploitation of wind energy. We formulate this problem as a mixed integer programming ...

This paper presents a framework to determine optimal maintenance planning of a fleet of complex and independent systems. They are made up of several major co...

The inventory routing problem (IRP) and the production routing problem (PRP) are two difficult problems arising in the planning of integrated supply chains...

Interior-point methods in semi-definite programming (SDP) require the solution of a sequence of linear systems which are used to derive the search directions...

Finding <i>p</i> prototypes by minimizing the sum of the squared distances from a set of points to its closest prototype is a well-studied problem in cluste...

OPAL is a general-purpose system for modeling and solving algorithm optimization problems. OPAL takes an algorithm as input, and as output it suggests para...