科研组 : RO - Operation Research
Axes : TMC (👥👥), AID (👥), ASN (👥).科研组负责人 :
Bruno Escoffier Campus Pierre et Marie Curie 26-00/419
简介
Webpage of the seminar of the team S seminar.
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.
operations research, scheduling, combinatorial optimization, black-box optimization, exact and approximation algorithm, complexity.
现无事件
档案Selected publications
- S. Angelopoulos : “Online Search With a Hint”12th Innovations in Theoretical Computer Science Conference (ITCS 2021), vol. 185, Leibniz International Proceedings in Informatics (LIPIcs), Online Event, United States, pp. 51:1-51:16, (Schloss Dagstuhl--Leibniz-Zentrum für Informatik)[Angelopoulos 2021b]
- S. Angelopoulos, Ch. Dürr, Sh. Kamali, Sh. Jin, M. Renault : “Online Computation with Untrusted Advice”11th Innovations in Theoretical Computer Science Conference (ITCS 2020), vol. 151, Leibniz International Proceedings in Informatics (LIPIcs), Seattle, United States, pp. 52:1-52:15, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik)[Angelopoulos 2020c]
- E. Bampis, Ch. Dürr, Th. Erlebach, M. Santos De Lima, N. Megow, J. Schlöter : “Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty”29th Annual European Symposium on Algorithms (ESA 2021), vol. 204, Leibniz International Proceedings in Informatics (LIPIcs), Lisboa, Portugal, pp. 10:1-10:18, (Schloss Dagstuhl -- Leibniz-Zentrum für Informatik)[Bampis 2021b]
- E. Bampis, B. Escoffier, A. Teiller : “Multistage knapsack”Journal of Computer and System Sciences, vol. 126, pp. 106-118, (Elsevier)[Bampis 2022a]
- P. Bendotti, Ph. Chrétienne, P. Fouilhoux, A. Pass‑Lanneau : “Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem”European Journal of Operational Research, vol. 295 (1), pp. 22-33, (Elsevier)[Bendotti 2021b]
- A. Biedenkapp, N. Dang, M. Krejca, F. Hutter, C. Doerr : “Theory-inspired Parameter Control Benchmarks for Dynamic Algorithm Configuration”GECCO '22: Genetic and Evolutionary Computation Conference, Boston, United States, pp. 766-775[Biedenkapp 2022]
- V. Bouquet, F. Delbot, Ch. Picouleau : “On the vertices belonging to all, some, none minimum dominating set”Discrete Applied Mathematics, vol. 288, pp. 9-19, (Elsevier)[Bouquet 2021]
- V. Cohen‑Addad, D. Saulpic, Ch. Schwiegelshohn : “A new coreset framework for clustering”STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, Rome ( Virtual ), Italy, pp. 169-182, (ACM)[Cohen-Addad 2021c]
- B. Doerr, C. Doerr, J. Lengler : “Self-Adjusting Mutation Rates with Provably Optimal Success Rules”Algorithmica, vol. 83 (10), pp. 3108-3147, (Springer Verlag)[Doerr 2021a]
- M. Durand, F. Pascual : “Efficiency and equity in the multi organization scheduling problem”Theoretical Computer Science, vol. 864, pp. 103-117, (Elsevier)[Durand 2021a]
- C. Hanen, Z. Hanzalek : “Grouping tasks to save energy in a cyclic scheduling problem: A complexity study”European Journal of Operational Research, vol. 284 (2), pp. 445-459, (Elsevier)[Hanen 2020b]
- C. Hanen, A. Munier Kordon, Th. Pedersen : “Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors”Integration of Constraint Programming, Artificial Intelligence, and Operations Research, vol. 12735, Lecture Notes in Computer Science, Vienne, Austria, pp. 214-230, (Springer International Publishing)[Hanen 2021b]
- E. Hyon, A. Jean‑Marie : “Optimal control of admission in service in a queue with impatience and setup costs”Performance Evaluation, vol. 144, pp. 102134, (Elsevier)[Hyon 2020]