Blackbox optimization typically arises when the functions defining the objective and constraints of an optimization problem are computed through a computer...

Finding clusters, or communities, in a graph, or network is a very important problem which arises in many domains. Several models were proposed for its solu...

This work introduces the use of the treed Gaussian process (TGP) as a surrogate model within the mesh adaptive direct search (MADS) framework for constrain...

The Mesh Adaptive Direct Search (MADS) class of algorithms is designed for nonsmooth optimization, where the objective function and constraints are typical...

The MaxSumSum (maximum diversity) problem consists of the selection of <i>p</i> facilities among <i>n</i> candidate locations in a way that the total sum ...

The airline fleet assignment problem (FAP) consists of assigning an aircraft type to each flight leg of a flight schedule in order to maximize the airline ...

We consider a problem of groundwater management in which a group of farmers overexploits a groundwater stock and causes excessive pollution. A Water Agency...

In the absence of an international environmental agreement (IEA) on climate change, a country may be reluctant to unilaterally implement environmental acti...

Dynamic constraint aggregation (DCA) and dual variable stabilization (DVS) are two methods that can reduce the negative impact of degeneracy when solvi...

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...

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...

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

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 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...

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...

Implementations of the Simplex method differ only in very specific aspects such as the pivot rule. Similarly, most relaxation methods for mixed-integer ...