This paper focuses on the resolution of the capacitated minimum cost flow problem on a network comprising <i>n</i> nodes and <i>m</i> arcs. We present a met...

Remote communities are typically isolated from the main electricity grid and require local generation, most often relying on expensive resources (especially ...

Security-constrained optimal power flow (SCOPF) and security-constrained unit commitment (SCUC) problems are necessary tools for system operators for operati...

The Mesh Adaptive Direct Search (MADS) algorithm is designed for blackbox optimization problems subject to general inequality constraints. Currently, MADS do...

Aircraft sizing, route network design, demand estimation and allocation of aircraft to routes are different facets of the air transportation optimization pro...

We introduce an efficient approach to evaluate counterparty risk and compute the Credit Value Adjustement for derivatives having early exercise features. The...

We present a matheuristic, an integer programming based heuristic, for the liner shipping network design problem. This problem consists of finding a set of...

This paper presents a new method for solving the short-term unit commitment and loading problem of a hydropower system. Dynamic programming is used to comput...

The inventory-routing problem (IRP) integrates two well-studied problems, namely, inventory management and vehicle routing. Given a set of customers to servi...

Constrained blackbox optimization is a difficult problem, with most approaches coming from the mathematical programming literature. The statistical literatur...

Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer ...

A preconditioned variant of the Golub and Kahan (1965) bidiagonalization process recently proposed by Arioli (2013) and Arioli and Orban (2013) allows us to ...

In this article, we propose a general framework for an algorithm derived from the primal simplex that guarantees a strict improvement in the objective after ...

The dust suppression of hauling roads in open-pit mines is done by periodically spraying water from a water truck. The objective of this article is to presen...

Finding communities in complex networks is a topic of much current research and has applications in many domains. On the one hand, criteria for doing so hav...

This paper presents the first direct implementation of the positive edge criterion using COIN-OR's CLP, where it has been combined with the Devex pivot rule....

Commercial piracy and counterfeiting are widespread phenomena in different businesses, ranging from software and video games to luxury fashion products. Th...

Typical challenges of simulation-based design optimization include unavailable gradients and unreliable approximations thereof, expensive function evaluation...

This article describes the problem in which the edges of a network represent customers, and a quantity of material is delivered to them so that each one achi...

We propose an efficient heuristic method based on Space Partitioning (SP) and Tabu Search (TS) to solve the buffer sizing problem in unreliable production li...