Within a non-cooperative transboundary pollution dynamic game, we study the strategic impact of a region's investment in the adoption of a cleaner technolog...

We review dynamic quality models both in single-agent setup and in a competitive framework. Our objectives are: (1) to give the reader a vantage point on t...

In most Swiss municipalities, a curbside system consisting of heavy trucks stopping at almost each household is used for non-recoverable waste collection. Du...

A compact operations research (OR) model is proposed to analyse the prospects of meeting the Paris Agreement targets when direct air capture technologies can...

Product recalls are often consequences of quality failures. While such failures are related to a manufacturer's or supplier's design quality, the perceived q...

It is a challenge to sustain cooperation in a finite-horizon dynamic game. Since players generally have an incentive to deviate to their noncooperative str...

Column generation is an iterative method used to solve a variety of optimization problems. It decomposes the problem into two parts: a master problem, and on...

This paper presents DCISolver.jl a new Julia package implementating the Dynamic Control of Infeasibility method (DCI), introduced by Bielschowsky & Gomes (20...

In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated in...

A piecewise constant Mayer cost function is used to model optimal control problems in which the state space is partitioned into several regions, each having ...

The use of space through satellites is more and more important for nations, companies, and individuals. However, since the first satellite was sent up in 19...

This paper presents an efficient method for extracting the second-order sensitivities from a system of implicit nonlinear equations. We design a custom aut...

For a simple connected graph \(G\), let \(D(G), ~Tr(G)\), \(D^{L}(G)=Tr(G)-D(G)\), and \(D^{Q}(G)=Tr(G)+D(G)\) be the distance matrix, the diagonal m...

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\). In this paper, w...

The Tenth Montreal IPSW took place on August 13-27, 2020, and was jointly organized by the Centre de recherches mathématiques (CRM) and the Institute for Dat...

For a graph \(G\), the signless Laplacian matrix \(Q(G)\) defined as \(Q(G) = D(G) + A(G)\), where \(A(G)\) is the adjacency matrix of \(G\) and `...

In this paper we examine the stability of international environmental agreements about a (common) emissions target. By signing the agreement, the parties d...

The increasingly complex energy systems are turning the attention towards model-free control approaches such as reinforcement learning (RL). This work propos...

A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with \(n=2^s\) vertices is not known when \(s \ge 3\). T...

Binary quadratic programming (BQP) is a class of combinatorial optimization problems comprising binary variables, quadratic objective functions and linear/no...