In the recent years, the development of new algorithms for multiobjective optimization has considerably grown. A large number of performance indicators has...

A hyper-heuristic refers to a search method or a learning mechanism for selecting or generating heuristics to solve computational search problems. Operat...

In this paper, we develop algorithmic approaches for a recently defined class of games, the integer programming games. Two general methods to approximate an...

In this paper we tackle the problem of eNodeB failure detection in LTE networks using Binary Classification techniques under smart-cities Machine-to-Machine ...

Dans cet article, nous étudions le problème du partage de responsabilités dans la récupération de produits usés et son lien avec la conception d’une réglemen...

The optimal reactive power dispatch (ORPD) problem is an alternating current optimal power flow (ACOPF) problem where discrete control devices for regulating...

Top-tier customers -that is, those 20% of customers that typically bring in 80% of all profits- are extremely valuable to companies. In the many instances ...

The primal adjacency-based algorithm and the multi-directional dynamic programming algorithm are two exact methods that have recently been developed to effic...

Une nouvelle approche est développée dans cet article pour résoudre le problème de la planification stratégique de production d'une mine à ciel-ouvert dans...

This paper addresses the problem of distributing uniformly infrared radiative energy intercepted by a thermoplastic sheet surface during the infrared radiati...

Genetic algorithms are used for feature selection through a fitness function that drives the evolution of populations. With parallel universes, an importance...

The eccentric connectivity index of a connected graph \(G\) is the sum over all vertices \(v\) of the product \(d_G(v)e_G(v)\), where \(d_G(v)\) is ...

We study an integrated process configuration, lot-sizing, and scheduling problem, which appears in a real production environment in the packaging industry. P...

In this paper, we consider non-stationary response variables and covariates, where the marginal distributions and the associated copula may be time-dependent...

We extend a quasi-Monte Carlo scheme designed for coagulation to the simulation of the coagulation-fragmentation equation. A number \(N\) of particles is ...

The eccentricity of a vertex \(v\) in a graph \(G\) is the maximum distance between \(v\) and any other vertex of \(G\). The diameter of a graph `(...

A graceful difference labeling (gdl for short) of a directed graph \(G\) with vertex set \(V\) is a bijection `(f:V\rightarrow{1,\ldots,\vert V\vert}...

Given a directed graph \(G=(V,A)\), capacity and cost functions on \(A\), a root \(r\), a subset \(T \subset V\) of terminals, and an integer \(k\)...

Dans cet article, nous considérons un modèle de pêcherie à deux espèces qui interagissent biologiquement de façon compétitive, symbiotique ou selon une rela...

L'étude des réseaux de télécommunications sans-fil pour cellulaire est importante, car ceux-ci consomment beaucoup d'énergie et ont un impact non négligeable...