3128 résultats — page 27 de 157

, , et

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

référence BibTeX

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

référence BibTeX

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

référence BibTeX
, , et

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

référence BibTeX
, et

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

référence BibTeX
, , et

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

référence BibTeX
, , , et

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

référence BibTeX
, et

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

référence BibTeX
, , et

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

référence BibTeX
, , , et

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

référence BibTeX
et

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

référence BibTeX
et

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

référence BibTeX
, et

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

référence BibTeX
, et

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

référence BibTeX

This paper addresses combinatorial optimization problems under uncertain and correlated data where the mean-covariance information of the random data is assu...

référence BibTeX
, et

We consider the multivariate linear model for multilevel data where units are nested within a hierarchy of clusters. We propose permutation procedures to tes...

référence BibTeX
, , et

We consider a two-stage stochastic discrete program in which some of the second stage constraints involve expectations that cannot be computed easily and a...

référence BibTeX
, et

We present a new strategic multi-period optimization problem for the siting of electric vehicle (EV) charging stations. One main novelty in this problem is t...

référence BibTeX
, et

Smart homes have the potential to achieve optimal energy consumption with appropriate scheduling. It is expected that 35% of households in North America an...

référence BibTeX

Nous étudions un problème intégré de planification de production et de transport sur trois niveaux avec une structure de distribution (3LSPD), problème qui e...

référence BibTeX