Zobrazeno 1 - 10
of 124
pro vyhledávání: '"Stauffer, Gautier"'
Autor:
Wajge, Nishad, Stauffer, Gautier
This study explores strategic considerations in professional golf's Match Play format, challenging the conventional focus on individual performance. Leveraging PGA Tour data, we investigate the impact of factoring in an adversary's strategy. Our find
Externí odkaz:
http://arxiv.org/abs/2309.14403
Autor:
Stauffer, Gautier, Guillot, Matthieu
This study investigates strategic considerations in professional golf's Stroke Play format. We develop a Markov Decision Process (MDP) model, specifically a stochastic shortest path model, to optimize a golfer's strategy for any golf course. The mode
Externí odkaz:
http://arxiv.org/abs/2309.00485
In this paper, we introduce a new cooperative game theory model that we call production-distribution game to address a major open problem for operations research in forestry, raised by R\"onnqvist et al. in 2015, namely, that of modelling and proposi
Externí odkaz:
http://arxiv.org/abs/2211.04105
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this paper, we investigate the $k$-path coloring problem, a variant of vertex coloring arising in the context of integrated circuit manufacturing. In this setting, typical industrial instances exhibit a `tree-like' structure. We exploit this prope
Externí odkaz:
http://arxiv.org/abs/1904.11805
In this paper, we investigate the manufacturing of vias in integrated circuits with a new technology combining lithography and Directed Self Assembly (DSA). Optimizing the production time and costs in this new process entails minimizing the number of
Externí odkaz:
http://arxiv.org/abs/1902.04145
Given an undirected graph, are there $k$ matchings whose union covers all of its nodes, that is, a matching-$k$-cover? A first, easy polynomial solution from matroid union is possible, as already observed by Wang, Song and Yuan (Mathematical Programm
Externí odkaz:
http://arxiv.org/abs/1811.07327
Publikováno v:
In Transportation Research Part B November 2022 165:15-34
Autor:
Guillot, Matthieu, Stauffer, Gautier
In this paper, we give a new framework for the stochastic shortest path problem in finite state and action spaces. Our framework generalizes both the frameworks proposed by Bertsekas and Tsitsikli and by Bertsekas and Yu. We prove that the problem is
Externí odkaz:
http://arxiv.org/abs/1702.03186
Autor:
Stauffer, Gautier
Cette these presente les techniques d'optimisation combinatoire et de programmation entiere transversales a nos differents projets de recherche.
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00653059
http://tel.archives-ouvertes.fr/docs/00/65/30/59/PDF/hdr_main.pdf
http://tel.archives-ouvertes.fr/docs/00/65/30/59/PDF/hdr_main.pdf