In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order \(n\) and chromatic number ...

The Dial-a-Ride Problem (DARP) consists of designing a set of routes to transport clients from pickup node to delivery node, taking into account vehicle capa...

An electronic nose (e-nose), or artificial olfactometer, is a device that analyzes the air to quantify odor concentration using an array of gas sensors. Thi...

We study distributed methods for online prediction and stochastic optimization. Our approach is iterative: in each round nodes first perform local computatio...

The maximum \(k\)-colorable subgraph problem (\(k\)-MCSP) is to color as many vertices as possible with at most \(k\) colors, such that no two adjacent...

We consider a class of dynamic games played over an event tree, with random terminal. We assume that the players wish to jointly optimize their payoffs thr...

The Mesh Adaptive Direct Search algorithm (MADS) is an iterative method for constrained blackbox optimization problems. One of the optional MADS features i...

Two-level orthogonal designs play an important role in industrial screening experiments, in which the primary goal is to identify the treatment factors with ...

Recent developments in the global rare earth elements (REE) sector have caused a surge in motivation for nations outside of China to secure their own REE sup...

A decomposition method is developed to optimize a mineral value chain composed of a one or multiple mines and a material flow circuit. In the proposed decomp...

As open pit mining of a mineral deposit deepens, the cost of extraction may increase up to a threshold where transitioning to mining through underground meth...

High-order sequential simulation techniques for complex and non-Gaussian spatially distributed variables were developed over the last few years. This paper p...

Mineral value chains consist of material from multiple sources, several processing streams, and transportation systems that combine to generate various salea...

Over the past several years, there has been substantial progress in developing new stochastic mine planning optimization models and computationally efficient...

Network characterization and modelling is an important issue to understand and monitor IP network performance, in particular for real-time multimedia appli...

Considering a graph as a network of resistances, Klein and Randić (1993) proposed the definition of a distance measure. Indeed, if each edge of the graph re...

Clustering addresses the problem of finding homogeneous and well-separated subsets, called clusters, from a set of given data points. In addition to the poi...

This paper develops an international-trade game with two locally regulated producers. They may freely export but have to sell in their local market at a pric...

The \(k\)-means is a benchmark algorithm used in cluster analysis. It belongs to the large category of heuristics based on location-allocation steps that ...

The balanced clustering problem consists of partitioning a set of \(n\) objects into \(K\) equal-sized clusters as long as \(n\) is a multiple of `(K...