In this paper, we propose an empirical study of the centrality of actors in network. The data was collected among publicly available information of the boa...

Increase of bandwidth demand in data networks, driven by the continuous growth of the Internet and the increase of bandwidth greedy applications, raise the i...

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

We study call routing policies for call centers with multiple call types and multiple agent groups. We introduce new weight-based routing policies where each...

An edge-coloring of a graph \(G=(V,E)\) is a function \(c\) that assigns an integer \(c(e)\) (called color) in \(\{0,1,2,\dotsc\}\) to every edge `(...

The Recursive Largest First (RLF) algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color clas...

We show here that every \(m\)-dimensional semiring module \(M\) over an idempotent semiring \(S\) with strongly independent basis can be embedded in...

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

Air-conflict resolution is a bottleneck of air traffic management that will soon require powerful decision-aid systems to avoid the proliferation of delays....

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

In many applications, such as metabolomics, data are composed of several continuous measurements of subjects (tissues) over multiple variables (metabolites)....

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

In this paper, we suggest a new approach called the <i>return function</i> to deal with the determination of Bayesian-Nash equilibria in games of incomplet...

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