# Combinatorial optimization

A combinatorial optimization problem consists in determining a best solution among a discrete set of solutions, called feasible solutions. In general, such a set is finite but huge, and is described implicitly, i.e., by means of a list of constraints that any feasible solution must satisfy. In order to formalize the notion of a best solution, some function, called the objective function, is considered. It associates a real value to each solution, and a best, or optimal, solution, is then a feasible solution minimizing or maximizing this objective function. In particular, combinatorial optimization deals with practical problems such as optimizing the design and operating of production systems, or, more generally, optimizing the decision making process of a company.

The research work carried out in the Combinatorial optimization (OC) team covers two main topics: Mathematical programming and applications and Graphs and optimization.

## « Mathematical programming and applications »

This topic is essentially about discrete optimization (either linear or non linear). This kind of very general models can be used to formulate almost every single combinatorial optimization problem. Such problems are generally hard to solve, and, in many cases, only small ones can be solved efficiently. The researchers of the OC team that work on this topic aim at acquiring a better understanding of these problems, in order to be able to solve them more efficiently. They are also interested in solving efficiently practical optimization problems related to different fields: telecommunications, transport, energy, environment, etc. Finally, another aspect of interest is the one of finding robust optimal solutions for such problems. Indeed, in an industrial setting, it is usually more relevant to look for a “robust” solution, which will perform rather well in any possible situation, instead of looking for an “optimal” one for a very specific case. The OC team has already worked on the problem of computing such solutions, as the notion of robustness is a very rich and useful one.

## « Graphs and optimization »

Graphs are mathematical tools which play a central role in Operational Research. They can be used to model various types of systems. Finding an optimal solution then generally consists in identifying an optimal structure in a graph. Because of the sizes of the associated real instances, even a powerful computer is not sufficient to provide an optimal solution within a reasonable amount of time. In order to make such a solution easier to find, one often needs to prove structural properties of optimal solutions, and then, whenever this is possible, use them to design efficient algorithms to solve the problem, either exactly, or approximately. The researchers of the OC team that work on this topic aim at applying this approach to some graph optimization problems, that are general enough to model many real-life situations. They are also interested in approximation algorithms, parameterized algorithms, and online algorithms.

• Directory
• Publications
• Communication
• Valorisation
• PhD & HDR
• Projects

## 2023

### Articles de revue

1. Lambert, A. Using general triangle inequalities within Quadratic Convex Reformulation method. In Optimization Methods and Software, 38 (3): 626-653, 2023.
1. Elloumi, S. and Verchère, Z. Efficient linear reformulations for binary polynomial optimization problems. In Computers and Operations Research, 155: 106240, 2023.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. A stochastic dual dynamic integer programming based approach for remanufacturing planning under uncertainty. In International Journal of Production Research, 61 (17): 5992-6012, 2023.
1. Bentz, C.; Costa, M-C.; Poirion, P-l. and Ridremont, T. Robust capacitated Steiner trees and networks with~uniform demands. In Networks, 82 (1): 3-31, 2023.

## 2022

### Articles de revue

1. Porumbel, D. Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems. In INFORMS Journal on Computing, 2022.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. Combining polyhedral approaches and stochastic dual dynamic integer programming for solving the uncapacitated lot-sizing problem under uncertainty. In INFORMS Journal on Computing, 34 (2): 1024-1041, 2022.
1. Silva, I. F.; Bentz, C.; Bouhtou, M.; Chardy, M. and Kedad-Sidhoum, S. Managing a multi battery energy storage system of a telecommunications company in order to reduce the total energy cost. In International Journal of Smart Grid and Clean Energy, 2022.
1. Charles, M.; Dauzère-Pérès, S.; Kedad-Sidhoum, S. and Mazhoud, I. Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories. In European Journal of Operational Research, 302 (1): 203-220, 2022.
1. Ngueveu, S. U.; Artigues, C.; Absi, N. and Kedad-Sidhoum, S. Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs. In Journal of Heuristics, 28 (1): 93-120, 2022.
1. Dur'an Mateluna, C.; Alès, Z. and Elloumi, S. An efficient Benders decomposition for the p-median problem. In European Journal of Operational Research, 2022.
1. Falq, A-E.; Fouilhoux, P. and Kedad-Sidhoum, S. Dominance inequalities for scheduling around an unrestrictive common due date. In European Journal of Operational Research, 296 (2): 453-464, 2022.
1. Alès, Z. and Elloumi, S. Minimizing recovery cost of network optimization problems. In Networks, 2022.
1. Mencarelli, L.; Floquet, J.; Georges, F. and Grenier, D. Mixed integer (non)linear approaches for the satellite constellation design problem. In Optimization and Engineering, 2022.
1. Kim, E. J.; Milanic, M.; Monnot, J. and Picouleau, C. Complexity and algorithms for constant diameter augmentation problems. In Theoretical Computer Science, 904: 15-26, 2022.

## 2021

### Articles de revue

1. Bouquet, V.; Delbot, F. c. and Picouleau, C. On the vertices belonging to all, some, none minimum dominating set. In Discrete Applied Mathematics, 288: 9-19, 2021.
1. Chen, Z.; Fampa, M.; Lambert, A. and Lee, J. Mixing convex-optimization bounds for maximum-entropy sampling. In Mathematical Programming, 188: 539-568, 2021.
1. Regaieg, R.; Koub`aa, M.; Alès, Z. and Aguili, T. Multi-objective optimization for VM placement in homogeneous and heterogeneous cloud service provider data centers. In Computing, 103 (6): 1255-1279, 2021.
1. Elloumi, S.; Hudry, O.; Marie, E.; Martin, A.; Plateau, A. and Rovedakis, S. Optimization of wireless sensor networks deployment with coverage and connectivity constraints. In Annals of Operations Research, 298 (1-2): 183-206, 2021.
1. Falq, A-E.; Fouilhoux, P. and Kedad-Sidhoum, S. Mixed integer formulations using natural variables for single machine scheduling around a common due date. In Discrete Applied Mathematics, 290: 36-59, 2021.
1. Furini, F.; Lambert, A.; Létocart, L.; Liberti, L. and Traversi, E. Preface: CTW 2018. In Discrete Applied Mathematics, 296: 1, 2021.
1. Elloumi, S.; Lambert, A. and Lazare, A. Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation. In Journal of Global Optimization, 80 (2): 231-248, 2021.
1. Frosini, A.; Picouleau, C. and Rinaldi, S. Characterization of the degree sequences of (quasi) regular uniform hypergraphs. In Theoretical Computer Science, 868: 97-111, 2021.

## 2020

### Articles de revue

1. Bentz, C. and Le Bodic, P. Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth. In Theoretical Computer Science, 809: 239-249, 2020.
1. Quezada, F.; Gicquel, C.; Kedad-Sidhoum, S. and Vu, D. Q. A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales. In Computers and Operations Research, 116: 104865, 2020.
1. Alès, Z. and Knippel, A. The K-partitioning problem: Formulations and branch-and-cut. In Networks, 76 (3): 323-349, 2020.
1. Porumbel, D. C. Projective Cutting-Planes. In SIAM Journal on Optimization, 30 (1): 1007-1032, 2020.
1. Bucarey, V.; Elloumi, S.; Labbé, M. and Plein, F. Models and Algorithms for the Product Pricing with Single-Minded Customers Requesting Bundles. In Computers and Operations Research, 2020.
1. Costa, M.-C.; de Werra, D. and Picouleau, C. Minimal graphs for 2-factor extension. In Discrete Applied Mathematics, 2020.
1. Bentz, C.; Costa, M-C. and Hertz, A. On the edge capacitated Steiner tree problem. In Discrete Optimization, 38: 100607, 2020.
1. Porumbel, D. C. and Hao, J-K. Distance-guided local search. In Journal of Heuristics, 26 (5): 711-741, 2020.

## 2019

### Articles de revue

1. B"ulb"ul, K.; Kedad-Sidhoum, S. and c Sen, H. Single-machine common due date total earliness/tardiness scheduling with machine unavailability. In Journal of Scheduling, 22 (5): 543-565, 2019.
1. Paulusma, D.; Picouleau, C. and Ries, B. Critical vertices and edges in H-free graphs. In Discrete Applied Mathematics, 257: 361-367, 2019.
1. Elloumi, S. and Lambert, A. Global solution of non-convex quadratically constrained quadratic programs. In Optimization Methods and Software, 34 (1): 98-114, 2019.
1. Bentz, C. An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face. In Algorithmica, 81 (1): 224-237, 2019.
1. Bentz, C. Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees. In Theoretical Computer Science, 782: 11-29, 2019.

### Articles de conférence

1. Elloumi, S.; Lambert, A. and Lazare, A. Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems. In 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), pages 1498-1503, IEEE, Paris, France, 2019.
1. Godard, H.; Elloumi, S.; Lambert, A.; Maeght, J. and Ruiz, M. Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization. In 6th International Conference on Control, Decision and Information Technologies (CoDIT), Paris, France, 2019.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. Stochastic dual dynamic integer programming for a multi-echelon lot-sizing problem with remanufacturing and lost sales. In CODIT 2019- 6th IEEE International Conference on Control, Decision and Information Technologies, pages 1254-1259, IEEE, Paris, France, 2019.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. A Stochastic Dual Dynamic Integer Programming for the Uncapacitated Lot-Sizing Problem with Uncertain Demand and Costs. In ICAPS2019 - 29th International Conference on Automated Planning and Scheduling, pages 353-361, AAAI Press, Berkeley, United States, 2019.

## 2018

### Articles de revue

1. Phouratsamay, S-L.; Kedad-Sidhoum, S. and Pascual, F. Two-level lot-sizing with inventory bounds. In Discrete Optimization, 30: 1-19, 2018.
1. Billionnet, A. Quantifying extinction probabilities of endangered species for phylogenetic conservation prioritization may not be as sensitive as might be feared. In Biodiversity and Conservation, 27 (5): 1189-1200, 2018.
1. Artigues, C.; Bourreau, E.; Jost, V.; Kedad-Sidhoum, S. and Ramond, F. c. Trains do not vanish: the ROADEF/EURO challenge 2014. In Annals of Operations Research, 271 (2): 1091-1105, 2018.
1. Porumbel, D. C. Prize-collecting set multicovering with submodular pricing. In International Transactions in Operational Research, 25 (4): 1221-1239, 2018.
1. Bentz, C.; Costa, M-C.; Poirion, P-L. and Ridremont, T. Formulations for designing robust networks. An application to wind power collection. In Electronic Notes in Discrete Mathematics, 64: 365-374, 2018.
1. Alès, Z.; Pauchet, A. and Knippel, A. Extraction and Clustering of Two-Dimensional Dialogue Patterns. In International Journal on Artificial Intelligence Tools, 27 (02): 1850001, 2018.
1. Diner, ". Y. s.; Paulusma, D.; Picouleau, C. and Ries, B. Contraction and deletion blockers for perfect graphs and H-free graphs. In Theoretical Computer Science, 746: 49-72, 2018.
1. Billionnet, A. Phylogenetic conservation prioritization with uncertainty. In Biodiversity and Conservation, 27 (12): 3137-3153, 2018.
1. Helal, N.; Pichon, F.; Porumbel, D. C.; Mercier, D. and Lefevre, E. The capacitated vehicle routing problem with evidential demands. In International Journal of Approximate Reasoning, 95: 124-151, 2018.
1. Kedad-Sidhoum, S.; Monna, F.; Mounié, G. and Trystram, D. A Family of Scheduling Algorithms for Hybrid Parallel Platforms. In International Journal of Foundations of Computer Science, 29 (1): 63-90, 2018.
1. Bendotti, P.; Fouilhoux, P. and Kedad-Sidhoum, S. The Unit-capacity Constrained Permutation Problem. In European Journal of Operational Research, 268 (2): 463-472, 2018.
1. Bou-Fakhreddine, B.; Abou Chakra, S.; Mougharbel, I.; Faye, A. and Pollet, Y. Daily river flow prediction based on Two-Phase Constructive Fuzzy Systems Modeling: A case of hydrological -- meteorological measurements asymmetry. In Journal of Hydrology, 558: 255-265, 2018.
1. Alès, Z.; Nguyen, T. S. and Poss, M. Minimizing the weighted sum of completion times under processing time uncertainty. In Electronic Notes in Discrete Mathematics, 64: 15-24, 2018.
1. Costa, M-C.; de Werra, D. and Picouleau, C. Minimal graphs for matching extension. In Discrete Applied Mathematics, 234: 47-55, 2018.
1. Porumbel, D. C. From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints. In Discrete Optimization, 29: 148-173, 2018.
1. Bou-Fakhreddine, B.; Mougharbel, I.; Faye, A. and Pollet, Y. Estimating daily evaporation from poorly-monitored lakes using limited meteorological data: A case study within Qaraoun dam - Lebanon. In Journal of Environmental Management, 241: 502-513, 2018.
1. Faye, A. A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes. In European Journal of Operational Research, 270 (3), 2018.
1. Watel, D. and Faye, A. Taxi-Sharing: Parameterized Complexity and Approximability of the Dial-a-ride problem with money as an incentive. In Theoretical Computer Science, 745: 202-223, 2018.

### Articles de conférence

1. Falq, A-E.; Fouilhoux, P. and Kedad-Sidhoum, S. MIP Formulations for Just-in-Time Scheduling with Common Due-Date. In International Symposium on Combinatorial Optimization (ISCO 2018), Marrakesh, Morocco, 2018.
1. Alès, Z. and Elloumi, S. Compact MILP formulations for the p-center problem. In ISCO (International Symposium on Combinatorial Optimization) 2018, Marrakesh, France, 2018.

## 2017

### Articles de revue

1. Porumbel, D. C.; Goncalves, G.; Allaoui, H. and Hsu, T. Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem. In European Journal of Operational Research, 256 (2): 349-367, 2017.
1. Billionnet, A.; Elloumi, S.; Lambert, A. and Wiegele, A. Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. In INFORMS Journal on Computing, 29 (2): 318-331, 2017.
1. Billionnet, A. How to Take into Account Uncertainty in Species Extinction Probabilities for Phylogenetic Conservation Prioritization. In Environmental Modeling & Assessment, 22 (6): 535-548, 2017.
1. Alès, Z.; Rosa, B. F.; Souza, M. J. F.; de Souza, S. R.; de Franc ca Filho, M. F. and Michelon, P. Y. P. Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties. In Computers and Operations Research, 81: 203-215, 2017.

### Articles de conférence

1. Elloumi, S.; Hudry, O.; Marie, E.; Plateau, A. and Rovedakis, S. Optimization of wireless sensor networks deployment with coverage and connectivity constraints. In 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), pages 0336-0341, IEEE, Barcelona, Spain, IEEE , 2017.
1. Helal, N.; Pichon, F.; Porumbel, D. C.; Mercier, D. and Lefevre, E. A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands. In 14th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2017, Lugano, Switzerland, 2017.

## 2022

### Articles de conférence

1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. A partial decomposition approach for solving the stochastic uncapacitated lot-sizing problem. In EURO2022 - 32nd European Conference on Operations Research, Espoo, Finland, 2022.
1. Mencarelli, L. An Outer Approximation Algorithm for 0-1 Polynomial Programming. In HUGO 2022 - XV. Workshop on Global Optimization, Szeged, Hungary, 2022.
1. Lambert, A. Exact solution of the OPF problem based on compact quadratically constrained convex relaxation. In 32nd European Conference on Operational Research (EURO 2022), Espoo, Finland, 2022.
1. Alès, Z.; Huré, V. and Lambert, A. New optimization models for optimal classification trees. In 32nd European Conference on Operational Research (EURO 2022), Espoo, Finland, 2022.
1. Picouleau, C. and Bouquet, V. The Perfect Matching-Cut problem in bipartite graphs with diameter three. In ICGT 2022, Montpellier, France, 2022.
1. Dur'an Mateluna, C.; Jorquera-Bravo, N.; Alès, Z. and Elloumi, S. Robust MILP formulations for the two-stage p-Center Problem. In PGMO Days 2022, Palaiseau, France, 2022.
1. Elloumi, S.; Lambert, A.; Neveu, B. and Trombettoni, G. Global Solution of Quadratic Problems by Interval Methods and Convex Reformulation. In HUGO 2022 - 15th Workshop on Global Optimization, Szeged, Hungary, 2022.
1. Alès, Z.; Elloumi, S. and Pass-Lanneau, A. Algorithmes de placement optimisé de drones pour la conception de réseaux de communication. In Conference on Artificial Intelligence for Defense (CAID) 2022, Rennes, France, Actes de la 4ème Conference on Artificial Intelligence for Defense (CAID 2022) , 2022.
1. Mencarelli, L.; Floquet, J.; Georges, F.; Guillaud, B. and Mellouki, W. The Satellite Constellation Design Problem via MI(N)LP Boosted with a Genetic Algorithm. In PGMO Days 2022, Palaiseau, France, 2022.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. A partial decomposition approach to solve the stochastic uncapacitated lot-sizing problem. In ECSO-CMS 2022 - European Conference on Stochastic Optimization - Computational Management Science, Venice, Italy, 2022.
1. Porumbel, D. C. Projective Cutting Planes with multiple cuts per iteration for robust linear programming. In PGMO Days 2022, Palaiseau (91), France, 2022.

### Divers

1. Yuehgoh, F.; Travers, N. and Djebali, S. A Technology Intelligence Recommendation System based on Multiplex Networks. , Poster.
1. Yuehgoh, F.; Travers, N. and Djebali, S. A Technology Intelligence Recommendation System based on Multiplex Networks. , Poster.

## 2021

### Articles de conférence

1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. A partial nested decomposition approach for remanufacturing planning under uncertainty. In IFIP International Conference on Advances in Production Management Systems (APMS), pages 663-672, Springer International Publishing, Nantes, France, Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems AICT-631, 2021.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. New valid inequalities for a multi-item multi-echelon lot-sizing problem with returns and lost sales. In IWLS 2021 - International Workshop on Lot-Sizing, online streaming, France, 2021.
1. Charles, M.; Dauzere-Peres, S.; Kedad-Sidhoum, S. and Mazhoud, I. Capacitated lot-sizing problem with inventory constraints within periods. In 2021 IEEE 17th International Conference on Automation Science and Engineering (CASE), pages 1021-1026, IEEE, Lyon, France, 2021.
1. Mencarelli, L.; Floquet, J. and Georges, F. Mixed Integer Nonlinear Approaches for the Satellite Constellation Design Problem. In PGMO DAYS 2021, Palaiseau, France, 2021.

### Rapports

1. Guillemin, F.; Navas, R.; Aimi, A.; Aubonnet, T.; Kerdoncuff, T-. G.; Secci, S.; Hadjadj-Aoul, Y.; Rovedakis, S. and Boubendir, A. Reference architecture for slicing in LoRAWAN networks. Technical Report, Consortium INTELLIGENTSIA, 2021.

## 2020

### Chapitres d'ouvrage

1. Etheve, M.; Alès, Z.; Bissuel, C.; Kedad-Sidhoum, S. and Juan, O. Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pages 176-185, 2020.

### Articles de conférence

1. Bentz, C.; Costa, M-C.; Poirion, P-L.; Ridremont, T. and Zakour, C. Wind farm cable layout optimization with constraints of load flow and robustness. In ICREEE 2020: International Conference on Renewable Energy and Environment Engineering, Tokyo (on line), Japan, 2020.
1. Silva, I. F.; Bouhtou, M.; Chardy, M.; Bentz, C. and Kedad-Sidhoum, S. Battery Energy Management of a Telecommunications Company to Participate in the Curtailment Market and Reduce the Total Energy Cost. In 2020 IEEE 8th International Conference on Smart Energy Grid Engineering (SEGE), pages 121-127, IEEE, Oshawa, France, 2020.

## 2019

### Articles de conférence

1. Falq, A-E.; Fouilhoux, P. and Kedad-Sidhoum, S. Inégalités linéaires de dominance pour l'ordonnancement juste-`a-temps avec date d'échéance commune non restrictive. In JPOC11 : Journées Polyèdres et Optimisation Combinatoire, Metz, France, 2019.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. A dynamic programming based decomposition approach for the stochastic uncapacitated single-item lot-sizing problem. In IWLS 2019 - 10th International Workshop on Lot sizing, pages 73-77, Paris, France, 2019.
1. Falq, A-E.; Fouilhoux, P. and Kedad-Sidhoum, S. MIP formulations for just-in-time scheduling around a common due-date. In 14th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2019), Renesse, Netherlands, 2019.
1. Charles, M.; Dauzère-Pérès, S. and Kedad-Sidhoum, S. More realistic test instances for the Capacitated Lot-Sizing Problem. In 30th European Conference On Oparational Research, EURO2019, Dublin, Ireland, 2019.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. Stochastic lot-sizing problem with remanufacturing: a dual dynamic decomposition approach. In PGMO Days, Paris, France, 2019.
1. Silva, I. F.; Bentz, C.; Bouhtou, M.; Chardy, M. and Kedad-Sidhoum, S. Energy storage management with energy curtailing incentives in a telecommunications context. In 10th International Workshop on Lot sizing - IWLS 2019, Paris, France, 2019.
1. Lambert, A.; Elloumi, S.; Godard, H.; Maeght, J. and Ruiz, M. Solving Alternative Current Optimal Power Flow to Global Optimality with Quadratic Reformulation Using Semi-Definite Programming and Branch-and-Bound. In PGMO days, Palaiseau, France, 2019.
1. Lucas, R.; Alès, Z.; Ramond, F. c. and Elloumi, S. Reducing the Adaptation Costs of a Rolling Stock Schedule with Adaptive Solution: the Case of Demand Changes. In RailNorrk"oping 2019. 8th International Conference on Railway Operations Modelling and Analysis (ICROMA), pages 857-876, Norrk"oping, Sweden, Link"oping Electronic Conference Proceedings 69, 2019.
1. Lambert, A.; Elloumi, S.; Lazare, A. and Rodriguez-Heck, E. The Impact of Quadratization in Convexification-Based Resolution of Polynomial Binary Optimization. In PGMO days, Palaiseau, France, 2019.
1. Silva, I. F.; Bentz, C.; Bouhtou, M.; Chardy, M. and Kedad-Sidhoum, S. Optimizing Battery Usage for a Telecommunications Company Participating in a Curtailing Market. In PGMODays 2019, Paris, France, 2019.
1. Charles, M.; Dauzère-Pérès, S.; Kedad-Sidhoum, S. and Mazhoud, I. Parallelized approaches to solve the capacitated lot-sizing problem with lost sales and setup times. In 10th International Workshop on Lot sizing - IWLS 2019, Paris, France, 2019.
1. Ethève, M.; Alès, Z.; Bissuel, C.; Juan, O. and Kedad-Sidhoum, S. A Graph-based Heuristic for Variable Selection in Mixed Integer Linear Programming. In PGMO Days, Paris, France, 2019.

## 2018

### Chapitres d'ouvrage

1. Alès, Z. and Elloumi, S. Compact MILP formulations for the p-center problem. In Combinatorial Optimization, pages 14-25, Springer, Lecture Notes in Computer Science 10856, 2018.

### Articles de conférence

1. Dauzère-Pérès, S.; Absi, N.; Kedad-Sidhoum, S.; Penz, B. and Rapine, C. The single-item green lot-sizing problem with fixed carbon emissions. In European Conference on Operational Reasearch, Valencia, Spain, 2018.
1. Absi, N.; Artigues, C.; Kedad-Sidhoum, S.; Ngueveu, S. U. and Goupil, F. Upper and lower bounds for an energy scheduling problem with piecewise-linear costs and storageresources. In PGMO Days, Paris, France, 2018.
1. Lucas, R.; Alès, Z. and Elloumi, S. A MILP Formulation for Adaptive Solutions in Railway Scheduling. In PGMO Days 2018, Palaiseau, France, 2018.
1. Milliet de Faverges, M.; Russolillo, G.; Picouleau, C.; Merabet, B. and Houzel, B. Modelling passenger train arrival delays with Generalized Linear Models and its perspective for scheduling at main stations. In 8th International Conference on Railway Engineering (ICRE 2018), IET, London, United Kingdom, 2018.
1. Lambert, A. Valid inequalities for QCQPs. In ISMP 18, Bordeaux, France, 2018.
1. Lambert, A.; Elloumi, S. and Lazare, A. Unconstrained 0-1 polynomial optimization through convex quadratic reformulation. In ISMP 18, Bordeaux, France, 2018.
1. Absi, N.; Artigues, C.; Kedad-Sidhoum, S.; Ngueveu, S. U.; Rannou, J. and Saadi, O. Scheduling energy-consuming jobs on parallel machines with piecewise-linear costs and storage resources: A lot-sizing and scheduling perspective. In 16th International Conference on Project Management and Scheduling - PMS 2018, pages 1-4, TexMat, Rome, Italy, 2018.
1. Bentz, C.; Costa, M-C. and Hertz, A. Minimum length disjoint paths and Capacitated (rooted) Steiner Tree. In Euro-Alio International Conference on Applied Combinatorial Optimization Aims and Objectives, Bologna, Italy, 2018.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. Valid inequalities for solving a stochastic lot-sizing problem with returns. In ISMP 2018 - 23rd Symposium on Mathematical Programming, Bordeaux, France, 2018.
1. Falq, A-E.; Fouilhoux, P. and Kedad-Sidhoum, S. Extreme points for scheduling around a common due date. In ISMP International Conference on Mathematical Programming (ISMP 2018), Bordeaux, France, 2018.
1. Quezada, F.; Gicquel, C. and Kedad-Sidhoum, S. Stochastic lot-sizing for remanufacturing planning with lost sales and returns. In IWLS 2018 - 9th International Workshop on Lot sizing, Ubatuba, Brazil, 2018.
1. Ngueveu, S. U.; Absi, N.; Artigues, C.; Kedad-Sidhoum, S. and Goupil, F. Decomposition method in a scheduling problem with energy storage and costs. In International Symposium on Mathematical Programming - ISMP 2018, Bordeaux, France, 2018.
1. Lambert, A.; Elloumi, S.; Godard, H.; Maeght, J. and Ruiz, M. Solve Alternative Current Optimal Power Flow to global optimality. In ISMP 18, bordeaux, France, 2018.

## 2017

### Livres

1. Delacroix, J.; Barthélemy, F. c.; Fournier, R.; Gil-Michalon, I.; Lambert, A.; Plateau, A.; Rovedakis, S.; Simonot, M.; Thion, V. and Waymel, E. Informatique. Dunod, Fluoresciences , 2017.

### Articles de conférence

1. Elloumi, S.; Lambert, A. and Lazare, A. Global optimisation of binary polynomial programs. In PGMO Days, Palaiseau, France, 2017.
1. Lambert, A. and Elloumi, S. Quadratic convex reformulation for partitioning problems. In EUROPT 17, Montreal, Canada, 2017.
1. Elloumi, S.; Godard, H.; Lambert, A.; Maeght, J. and Ruiz, M. Solving Optimal Power Flow through reformulation. In 15th EUROPT Workshop on Advances in Continuous Optimization, montréal, Canada, 2017.

## 2020

### Articles de revue

1. Billionnet, A. La R.O. pour préserver la biodiversité. In Tangente (Paris) (75): 58-60, 2020.

## Ongoing projects

Saint Gobain Medvedev
• Full name: Collaboration cifre Saint Gobian Anton Medvedev: Saint Gobain Medvedev - Funder: Saint Gobain
• Duration: April 2022 - March 2025
• Description:
Dotation OC 2024
• Full name: Dotation OC 2024: Dotation OC 2024 - Funder: Laboratoire Cédric
• Duration: January 2024 - December 2024
• Description:
PEX Orion 2024
• Full name: PEX Orion 2024: PEX Orion 2024 - Funder: Laboratoire Cédric
• Duration: January 2024 - December 2024
• Description:
PEX BATEO 2024
• Full name: PEX BATEO 2024: PEX BATEO 2024 - Funder: Laboratoire Cédric
• Duration: January 2024 - December 2024
• Description:

## Past projects

• Full name: Optimisation combinatoire 2021
• Duration: January 2020 - December 2021
• Description:

• Full name: France GALOP
• Duration: December 2016 - December 2019
• Description:

• Full name: DIM RFSI no 2018-06
• Duration: May 2019 - October 2019
• Description:

• Full name: DIM RFSI no 2018-15
• Duration: February 2019 - December 2019
• Description:

• Full name: RTE GODARD
• Duration: January 2017 - December 2019
• Description: Ce projet traite de la résolution exacte du problème de l’Optimal Power Flow (OPF). Sa modélisation comme un problème quadratique non convexe sous contraintes quadratiques non convexes place l’OPF dans la catégorie des problèmes d’optimisation difficiles. Des techniques de reformula- tion quadratique convexe en perturbant l’objectif à l’aide d’une matrice SDP ont été récemment développées et appliquées à des problèmes non convexes. Cette refor- mulation quadratique convexe est ici appliquée et spécialisée à la résolution globale de l’OPF à l’aide d’un Spatial Branch and Bound.

• Full name: SPIROPS COLOMBIER
• Duration: February 2017 - January 2020
• Description:

• Full name: CNCF RESEAU Marie MILLIET
• Duration: February 2017 - January 2020
• Description:

• Full name: Orange Isaias FARIA
• Duration: December 2018 - December 2021
• Description:

• Full name: EDF Marc ETHEVE
• Duration: January 2019 - December 2022
• Description:

• Full name: FRANCE GALOP HOUDAYER
• Duration: January 2018 - January 2021
• Description:

• Full name: Sté KARDINAL HYOSEOK Kim
• Duration: October 2020 - September 2023
• Description:

• Full name: Soutien équipe OC 2022
• Duration: January 2022 - December 2022
• Description:

• Full name: Dotation OC 2023
• Duration: January 2023 - December 2023
• Description:

• Full name: PEX ORION 2023
• Duration: January 2023 - December 2023
• Description:

Top