Nous proposons une méthode itérative pour les problèmes aux moindres carrés linéaires \(A x \approx b\) nommée LSLQ. La méthode repose sur le processus ...

The object of study in the recent theory of Mean Field Games has been primarily large populations of agents interacting through a population dependent coupli...

While the joint optimization of production and outbound distribution decisions in a manufacturing context has been intensively studied in the past decade, th...

The integration of biorefinery processes into existing pulp and paper mills has been identified as a promising avenue to maintain mills activities. It could ...

The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph \(G\) are the spectra of the distance, distance Laplacian and...

The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 ...

La littérature en R&D a établi que si le paramètre mesurant le débordement en connaissance est suffisamment élevé, alors les firmes investissent plus en rech...

This paper presents three hyper-heuristic approaches for the stochastic open-pit mine production scheduling problem with one processing stream (SMPS) and one...

Locally weighted regression combines the advantages of polynomial regression and kernel smoothing. We present three ideas for appropriate and effective use...

In this paper, we study how uncertainties weighing on the climate system impact the optimal technological pathways the world energy system should take to com...

La méthode de branch-cut-and-price est la plus performante pour une grande panoplie de problèmes de tournées de véhicules (PTV). Pour plusieurs d'entre eux...

We analyze a transboundary pollution differential game where pollution control is spatially distributed among a number of agents with predetermined spatial r...

Dans cet article, nous nous intéressons à létude des valeurs propres du laplacien des distances d'un graphe connexe d'ordre \(n\) et de nombre chromatique ...

On considère un jeu dynamique défini sur un arbre d’évènements avec temps terminal aléatoire. On suppose que les joueurs coopèrent pour maximiser leur gain ...

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

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

Dans cet article, nous analysons un jeu de commerce international où les producteurs peuvent librement exporter, mais sont soumis à une tarification au coût ...

In this paper, we propose an integer programming model for obtaining lower bounds for the curriculum-based course timetabling problem, in which weekly assign...

La quadrature de Gauss-Radau nous permet d'obtenir une borne supérieure peu coûteuse sur l'erreur en norme Euclidienne associée aux itérés de SYMMLQ appliqu...