-
Multigrid methods for zero-sum two player stochastic games
In this thesis, we present some algorithms and numerical results for the solution of large scale zero-sum two player repeated stochastic games. In particular, we... -
Graph Structures for Knowledge Representation and Reasoning, Proceeding of Se...
Second International Workshop, GKR 2011, Barcelona, Spain, July 16, 2011. Revised Selected Papers -
Polynomial time algorithms for constant capacitated single-item lot sizing pr...
International audience -
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoin...
The algorithmic techniques presented in this paper (particularly the block partitioning framework) were used as part of the official solutions for several tasks proposed by the... -
Stochastic control and applications to finance
This thesis contains three parts that can be read independently. In the first part, we study the resolution of stochastic control problems by quantization methods. The... -
Inferring Company Structure from Limited Available Information
Some of the algorithmic techniques presented in this paper were used as part of the solutions for some of the tasks proposed in several programming contests in which the first... -
Optimized energy management control for the Toyota Hybrid System using dynami...
International audience -
General limit value in Dynamic Programming
We consider a dynamic programming problem with arbitrary state space and bounded rewards. Is it possible to define in an unique way a limit value for the problem,... -
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
International audience -
Implementation of comfort constraints in dynamic programming for hybrid vehic...
International audience -
Min-max and min-max (relative) regret approaches to representatives selection...
International audience -
Basics of Dynamic Programming for Revenue Management
International audience -
A New Exact Algorithm to Solve the Multi-Trip Vehicle Routing Problem with Ti...
This article tackles the multi-trip vehicule routing problem with time windows and limited duration. A trip is a timed route such that a succession of trips can be... -
Using the technology of cooperative driving for the traffic control at isolat...
The aim of this work is to benefit from the potential of the cooperative driving in order to optimize the traffic throughput at isolated intersections. To achieve this... -
The max-plus Martin boundary
We develop an idempotent version of probabilistic potential theory. The goal is to describe the set of max-plus harmonic functions, which give the stationary solutions... -
GMPLS Label Space Minimization through Hypergraph Layouts
International audience -
A unifying framework for seed sensitivity and its application to subset seeds
We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed... -
Two studies in risk management: portfolio insurance under risk measure constr...
In this thesis I'm interested in two aspects of portfolio management: the portfolio insurance under a risk measure constraint and quadratic hedge in incomplete... -
The k-Sparsest Subgraph Problem
Given a simple undirected graph G = (V, E) and an integer k ≤ |V|, the k-sparsest subgraph problem asks for a set of k vertices that induce the minimum number of... -
Minimum Dissatisfaction Personnel Scheduling
Some of the algorithmic techniques presented in this paper were later used by the first author for developing solutions to several algorithmic contest tasks (see the attached...
