We study a natural extension to the well-known convex hull problem by introducing multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set into multiple components and take the convex hull of each individual component, what is the minimum total sum of the perimeters of the convex hulls? We show why this proble...
Published in Annals of science
At the beginning of the 13th century Fibonacci described the rules for making mixtures of all kinds, using the Hindu-Arabic system of arithmetic. His work was repeated in the early printed books of arithmetic, many of which contained chapters on 'alligation', as the subject became known. But the rules were expressed in words, so the subject often a...
In the Spy game played on a graph G, a single spy travels the vertices of G at speed s, while multiple slow guards strive to have, at all times, one of them within distance d of that spy. In order to determine the smallest number of guards necessary for this task, we analyze the game through a Linear Programming formulation and the fractional strat...
Motivated by the approximation of Martingale Optimal Transport problems, westudy sampling methods preserving the convex order for two probability measures$\mu$ and $\nu$ on $\mathbb{R}^d$, with $\nu$ dominating $\mu$. When$(X_i)_{1\le i\le I}$ (resp. $(Y_j)_{1\le j\le J}$) are i.i.d. according $\mu$(resp. $\nu$), the empirical measures $\mu_I$ and ...
Ce manuscrit aborde des problèmes d’ordonnancement et de transport avec une modélisation explicite du transport. De tels problèmes se modélisent communément sous forme de graphes qui sont évalués afin d’obtenir les dates de début des opérations.Les évaluations classiques des graphes sont effectuées au moyen d’algorithmes de plus long chemin permett...
This research helps a European retailer with its daily goods delivery operations. The challenge is the limited capacity of the transportation network in the Amsterdam area. This leads to very strict requirements for the delivery routing plans. In order to respond to this challenge both an analytical model and a numerical method are proposed. This m...
The Flight-to-Gate Assignment Problem (FGAP) covers the optimal assignment of flights, or rather the aircraft serving these flights, to the available aircraft stands. Existing FGAP models in literature do not consider airside and landside processes simultaneously. We propose a FGAP model with three specifications, where only airside constraints are...
Collateral management has, during the most recent years, been an increasingly important part of a bank’s operation. The bank is facing an allocation problem of how to post collateral to all its counterparties in order to mitigate the credit risk and the number of transactions that requires collateralization is increasing. This master thesis has inv...
ABSTRACT The objective of this study was to identify the best regions for allocation of a forestry outgrower scheme, and the most efficient transportation system, using a mathematical programming model to minimize the wood supply costs in three Brazilian states. The forest outgrower scheme is a partnership between producers and forest companies, wi...
