Nhóm nghiên cứu : RO - Operation Research

Axes : TMC (👥👥), AID (👥), ASN (👥).

Trưởng nhóm :

Bruno Escoffier Campus Pierre et Marie Curie 26-00/419

Giới thiệu ngắn

The Operations Research team works on combinatorial optimization problems, with many applications to scheduling, network design but also lot-sizing, operations and supply chain management for example. We approach problems with algorithmic game theory, online and approximation algorithms, fixed parameter algorithms, self-stabilizing algorithms, search heuristics, blackbox complexity, mathematical programming, Markov decision processes and stochastic optimization. Our research both aims developing the theory and designing solutions for pure problems or real life applications.

scheduling, combinatorial optimization, operations research, exact and approximation algorithm, complexity.

No envent planned at present.

Lưu trữ

Selected publications

S. Angelopoulos, Ch. Dürr, Sh. Jin : “Best-Of-Two-Worlds Analysis of Online Search”, 36^th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), vol. 126, Leibniz International Proceedings in Informatics (LIPIcs), Berlin, Germany, pp. 7:1-7:17, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Angelopoulos 2019b]
V. Cohen‑Addad, Ph. Klein, C. Mathieu : “Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics”, SIAM Journal on Computing, vol. 48 (2), pp. 644-667, (Society for Industrial and Applied Mathematics) [Cohen-Addad 2019j]
B. Doerr, C. Doerr, J. Lengler : “Self-adjusting mutation rates with provably optimal success rules”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference, Prague, Czechia, pp. 1479-1487, (ACM Press) [Doerr 2019c]
B. Escoffier : “Saving colors and Max Coloring: some fixed-parameter tractability results”, Theoretical Computer Science, vol. 758, pp. 30-41, (Elsevier) [Escoffier 2019a]
E. Bampis, B. Escoffier, K. Schewior, A. Teiller : “Online Multistage Subset Maximization Problems”, 27^th Annual European Symposium on Algorithms (ESA 2019), vol. 144, Leibniz International Proceedings in Informatics (LIPIcs), Munich, Germany, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Bampis 2019b]
P. Bendotti, P. Fouilhoux, C. Rottner : “On the complexity of the Unit Commitment Problem”, Annals of Operations Research, vol. 274 (1-2), pp. 119-130, (Springer Verlag) [Bendotti 2019b]
F. Pascual, K. Rzadca : “Optimizing egalitarian performance when colocating tasks with types for cloud data center resource management”, IEEE Transactions on Parallel and Distributed Systems, (Institute of Electrical and Electronics Engineers) [Pascual 2019]
E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy Efficient Scheduling and Routing via Randomized Rounding”, Journal of Scheduling, vol. 21 (1), pp. 35-51, (Springer Verlag) [Bampis 2018a]
V. Cohen‑Addad, A. De Mesmay, E. Rotenberg, A. Roytman : “The Bane of Low-Dimensionality Clustering”, Proceedings of the Twenty-Ninth ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States [Cohen-Addad 2018b]
Ch. Dürr, Th. Erlebach, N. Megow, J. Meißner : “Scheduling with Explorable Uncertainty”, 9^th Innovations in Theoretical Computer Science Conference (ITCS 2018), vol. 94, Leibniz International Proceedings in Informatics (LIPIcs), Cambridge, United States, pp. 30:1-30:14, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Dürr 2018]
B. Doerr, C. Doerr : “Optimal Static and Self-Adjusting Parameter Choices for the ( 1 + ( λ , λ ) ) Genetic Algorithm”, Algorithmica, vol. 80, pp. 1658-1709, (Springer Verlag) [Doerr 2018a]
A. Carlier, C. Hanen, A. Munier‑Kordon : “The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays”, Journal of Scheduling, pp. 1-9, (Springer Verlag) [Carlier 2017]

All…