RO - Conference papers

Current teams :	ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL
Former team :	Phare

Publications RO	2017	2018	2019	2020	2021	2022	2023	Total
Books	0	1	2	0	1	0	0	4
Edited books	0	0	0	3	1	0	0	4
Journal articles	14	15	16	15	19	17	12	108
Book chapters	0	1	3	0	0	0	0	4
Conference papers	18	33	48	31	31	38	27	226
Habilitations	0	1	1	2	0	0	0	4
Theses	1	1	0	3	3	2	1	11

LIP6

M. Abrahamsen, A. Adamaszek, K. Bringmann, V. Cohen‑Addad, M. Mehr, E. Rotenberg, A. Roytman, M. Thorup : “Fast fencing”, The 50^th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, United States, pp. 564-573, (ACM Press) [Abrahamsen 2018]
N. Absi, Ch. Artigues, S. Kedad‑Sidhoum, S. Ngueveu, J. Rannou, O. Saadi : “Ordonnancement sous contraintes d’énergie avec stockage et couts linéaires par morceaux”, ROADEF 2018 - 19e congrès de la société française de Recherche Opérationnelle et d'Aide à la Décision, Lorient, France [Absi 2018a]
N. Absi, Ch. Artigues, S. Kedad‑Sidhoum, S. Ngueveu, J. Rannou, O. Saadi : “Scheduling energy-consuming jobs on parallel machines with piecewise-linear costs and storage resources: A lot-sizing and scheduling perspective”, 16^th International Conference on Project Management and Scheduling - PMS 2018, Rome, Italy, pp. 1-4, (TexMat) [Absi 2018b]
S. Angelopoulos, Ch. Dürr, Sh. Jin : “Online Maximum Matching with Recourse”, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), vol. 117, Leibniz International Proceedings in Informatics (LIPIcs), Liverpool, United Kingdom, pp. 8:1-8:15 [Angelopoulos 2018a]
L. Arantes, E. Bampis, A. Kononov, M. Letsios, G. Lucarelli, P. Sens : “Scheduling under Uncertainty: A Query-based Approach”, IJCAI 2018 - 27^th International Joint Conference on Artificial Intelligence, Stockholm, Sweden, pp. 4646-4652 [Arantes 2018]
E. Bampis, B. Escoffier, M. Lampis, Vangelis Th. Paschos : “Multistage Matchings”, 16^th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), vol. 101, Leibniz International Proceedings in Informatics (LIPIcs), Malmo, Sweden, pp. 7:1-7:13 [Bampis 2018b]
E. Bampis, B. Escoffier, S. Mladenovic : “Fair resource allocation over time”, AAMAS 2018 - 17^th International Conference on Autonomous Agents and MultiAgent Systems, Stockholm, Sweden, pp. 766-773, (International Foundation for Autonomous Agents and Multiagent Systems) [Bampis 2018c]
P. Bendotti, P. Fouilhoux, C. Rottner : “Breaking full-orbitopal symmetries and sub-symmetries”, ISMP International Conference on Mathematical Programming (ISMP 2018), Bordeaux, France [Bendotti 2018a]
P. Bendotti, P. Fouilhoux, C. Rottner : “Breaking symmetries for the UCP by intersecting the full orbitope with an hypercube face”, International Symposium on Combinatorial Optimization (ISCO 2018), Marrakesh, Morocco [Bendotti 2018b]
P. Bendotti, P. Fouilhoux, C. Rottner : “Casser les symétries dans les PLNE à deux indices”, ROADEF - 19ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Lorient, France [Bendotti 2018c]
P. Bendotti, Ph. Chrétienne, P. Fouilhoux, A. Pass‑Lanneau : “Ancrage de solutions en ordonnancement PERT”, ROADEF - 19ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Lorient, France [Bendotti 2018f]
P. Bendotti, Ph. Chrétienne, P. Fouilhoux, A. Pass‑Lanneau : “Robust proactive maintenance planning with a deadline”, PGMO Days 2018, Palaiseau, France [Bendotti 2018g]
V. Cohen‑Addad : “A Fast Approximation Scheme for Low-Dimensional k-Means”, SODA 2018 - 29h Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, pp. 430-440, (Society for Industrial and Applied Mathematics) [Cohen-Addad 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]
V. Cohen‑Addad, É. Colin de Verdière, A. De Mesmay : “A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals”, Proceedings of the Twenty-Ninth ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States [Cohen-Addad 2018c]
V. Cohen‑Addad, Ph. Klein, N. Young : “Balanced centroidal power diagrams for redistricting”, The 26^th ACM SIGSPATIAL International Conference, Seattle, United States, pp. 389-396, (ACM Press) [Cohen-Addad 2018d]
V. Cohen‑Addad, V. Kanade, F. Mallmann‑Trenn, C. Mathieu : “Hierarchical Clustering: Objective Functions and Algorithms”, SODA 2018 - Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, pp. 378-397, (Society for Industrial and Applied Mathematics) [Cohen-Addad 2018e]
C. Doerr : “Dynamic parameter choices in evolutionary computation”, GECCO '18 - Genetic and Evolutionary Computation Conference, Kyoto, Japan, pp. 800-830, (ACM Press) [Doerr 2018a]
C. Doerr, E. Carvalho Pinto : “A Simple Proof for the Usefulness of Crossover in Black-Box Optimization”, PPSN 2018: Parallel Problem Solving from Nature – PPSN XV, vol. 11102, Lecture Notes in Computer Science, Coimbra, Portugal, pp. 29-41, (Springer) [Doerr 2018c]
C. Doerr, F. Ye, S. Van Rijn, H. Wang, Th. Bäck : “Towards a theory-guided benchmarking suite for discrete black-box optimization heuristics”, GECCO '18 - Genetic and Evolutionary Computation Conference, Kyoto, France, pp. 951-958, (ACM Press) [Doerr 2018d]
C. Doerr, M. Wagner : “Sensitivity of Parameter Control Mechanisms with Respect to Their Initialization”, International Conference on Parallel Problem Solving from Nature (PPSN 2018), vol. 11102, Lecture Notes in Computer Science, Coimbra, Portugal, pp. 360-372 [Doerr 2018f]
C. Doerr, M. Wagner : “Simple on-the-fly parameter selection mechanisms for two classical discrete black-box optimization benchmark problems”, GECCO '18 - Genetic and Evolutionary Computation Conference, Kyoto, Japan, pp. 943-950, (ACM Press) [Doerr 2018g]
Ch. Dürr, Th. Erlebach, N. Megow, J. Meissner : “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 2018b]
A.‑E. Falq, P. Fouilhoux, S. Kedad‑Sidhoum : “Extreme points for scheduling around a common due date”, ISMP International Conference on Mathematical Programming (ISMP 2018), Bordeaux, France [Falq 2018a]
A.‑E. Falq, P. Fouilhoux, S. Kedad‑Sidhoum : “Formulations PLNE et dominances pour l’ordonnancement juste-à-temps avec date d’échéance commune”, ROADEF - 19ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Lorient, France [Falq 2018b]
A.‑E. Falq, P. Fouilhoux, S. Kedad‑Sidhoum : “MIP Formulations for Just-in-Time Scheduling with Common Due-Date”, International Symposium on Combinatorial Optimization (ISCO 2018), Marrakesh, Morocco [Falq 2018c]
A. Neumann, W. Gao, C. Doerr, F. Neumann, M. Wagner : “Discrepancy-based evolutionary diversity optimization”, GECCO '18 - Genetic and Evolutionary Computation Conference, Kyoto, France, pp. 991-998, (ACM Press) [Neumann 2018]
F. Pascual, K. Rzadca, P. Skowron : “Collective Schedules: Scheduling Meets Computational Social Choice”, Seventeenth International Conference on Autonomous Agents and Multiagent Systems, Stockholm, Sweden [Pascual 2018b]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “Lot-sizing for remanufacturing under uncertainty: a stochastic multi-stage mixed-integer programming approach”, ROADEF 2018 - 19e congrès de la société française de Recherche Opérationnelle et d'Aide à la Décision, Lorient, France [Quezada 2018a]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “Stochastic lot-sizing for remanufacturing planning with lost sales and returns”, IWLS 2018 - 9^th International Workshop on Lot sizing, Ubatuba, Brazil [Quezada 2018b]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “Valid inequalities for solving a stochastic lot-sizing problem with returns”, 23rs Symposium on Mathematical Programming - ISMP 2018, Bordeaux, France [Quezada 2018c]
O. Shir, C. Doerr, Th. Bäck : “Compiling a benchmarking test-suite for combinatorial black-box optimization”, GECCO '18 - Genetic and Evolutionary Computation Conference Companion, Kyoto, Japan, pp. 1753-1760, (ACM Press) [Shir 2018]
S. Van Rijn, C. Doerr, Th. Bäck : “Towards an Adaptive CMA-ES Configurator”, Parallel Problem Solving from Nature – PPSN XV. PPSN 2018., vol. 11101, Lecture Notes in Computer Science, Coimbra, Portugal, pp. 54-65, (Springer) [van Rijn 2018]

Mentions légales

Site map