3212 résultats — page 18 de 161

This work is in the context of blackbox optimization where the functions defining the problem are expensive to evaluate and where no derivatives are availabl...

référence BibTeX
, et

Nous étudions une classe de jeux déterministes à horizon fini à deux joueurs à somme non nulle où les joueurs sont dotés de différents types de commandes....

référence BibTeX

The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that sh...

référence BibTeX
, et

Dans cet article, nous adressons le problème de l’ordonnancement de l’arrêt/démarrage des génératrices dans un microréseau selon une approche visant à s’assu...

référence BibTeX
, et

Distance metric learning algorithms aim to appropriately measure similarities and distances between data points. In the context of clustering, metric learnin...

référence BibTeX

Optimal stopping is the problem of deciding the right time at which to take a particular action in a stochastic system, in order to maximize an expected rewa...

référence BibTeX

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with \(n=2^s\) sides are unknown when ...

référence BibTeX
et

A small polygon is a polygon of unit diameter. The maximal perimeter of a convex equilateral small polygon with \(n=2^s\) vertices is not known when `(s ...

référence BibTeX
, , , et

A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they indu...

référence BibTeX
, et

This paper develops a strategy, using concepts from Mean Field Games, to coordinate the charging of a large population of battery electric vehicles (BEVs...

référence BibTeX

The Quadratic Knapsack Problem (QKP) is a well-known combinatorial optimization problem which amounts to maximizing a quadratic function of binary variables,...

référence BibTeX

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with \(n=2^s\) vertices are not known ...

référence BibTeX

A small polygon is a polygon of unit diameter. The maximal area of a small polygon with \(n=2m\) vertices is not known when \(m\ge 7\). Finding the large...

référence BibTeX

A new linear model is presented herein to optimize strategic production scheduling of an open pit mine with multiple processing streams while accounting for...

référence BibTeX
et

Geostatistically simulated representations of mineral deposits are used for resource/reserve assessments, mine design and production planning, project evalua...

référence BibTeX
, et

Industrial mining complexes can be optimized using simultaneous stochastic optimization (SSO), which manages the risks associated with meeting production tar...

référence BibTeX
et

This paper presents a new truck dispatching policy approach that is adaptive given different mining complex configurations in order to deliver supply materia...

référence BibTeX

The existing technologies that update geostatistically simulated models of mineral deposits cannot self-learn from incoming new information generated in oper...

référence BibTeX

A training-image free, high-order sequential simulation method is proposed herein, which is based on the efficient inference of high-order spatial statistics...

référence BibTeX
et

This article presents a novel stochastic optimization model that simultaneously optimizes the short-term extraction sequence, shovel relocation, scheduling o...

référence BibTeX