Keywords
 A6. Modeling, simulation and control
 A6.1. Methods in mathematical modeling
 A6.2. Scientific computing, Numerical Analysis & Optimization
 A6.2.3. Probabilistic methods
 A6.2.6. Optimization
 A9.6. Decision support
 B4. Energy
 B4.3. Renewable energy production
 B4.4. Energy delivery
 B4.5. Energy consumption
 B6. IT and telecom
 B6.3.2. Network protocols
 B7. Transport and logistics
 B7.1. Traffic management
 B7.1.2. Road traffic
 B8.1. Smart building/home
 B8.1.1. Energy for smart buildings
 B8.2. Connected city
 B8.4. Security and personal assistance
1 Team members, visitors, external collaborators
Research Scientist
 Luce Brotcorne [Team leader, Inria, Senior Researcher, HDR]
Faculty Members
 Diego Cattaruzza [École centrale de Lille, Associate Professor]
 Bernard Fortz [VU Brussels, Belgium, Professor]
 Martine Labbé [VU Brussels, Belgium, Professor]
 Maxime Ogier [École centrale de Lille, Associate Professor]
 Frédéric Semet [École centrale de Lille, Professor, HDR]
PostDoctoral Fellows
 Ikram Bouras [Inria, until Sep 2020]
 Victor Bucarey Lopez [VU Brussels, Belgium, until July 2020]
 Renaud Chicoisne [VU Brussels, Belgium]
 Arnaud Laurent [Inria, until Jun 2020]
PhD Students
 Yaheng Cui [École des Mines de Paris, until Jan 2020]
 Jérôme De Boeck [VU Brussels, Belgium, Teaching assistant]
 Concepcion Dominguez Sanchez [VU Brussels, Belgium and Universidad de Murcia, Spain, FRIA fellowship]
 Matteo Petris [Inria]
 Fränk Plein [University of Sevilla, Spain and VU Brussels, Belgium, FNRS fellowship]
 Moises Rodriguez Madrena [University of Sevilla, Spain and VU Brussels, Belgium]
 Luis Salazar Zendeja [Conacyt, Mexico]
Technical Staff
 Tifaout Almeftah [Inria, Engineer]
 Mathieu Besancon [Inria, Engineer]
 Kaba Keita [Inria, Engineer, from May 2020]
 Arnaud Laurent [École centrale de Lille, Engineer, from Sep 2020]
 Yuan Yuan [École centrale de Lille, Engineer]
Interns and Apprentices
 Lucie Fontaine [Inria, from Jul 2020 until Aug 2020]
 Matthieu Plotton [École centrale de Lille, until Feb 2020]
Administrative Assistant
 Nathalie Bonte [Inria]
Visiting Scientists
 Ikram Bouras [ Ferhat Abbas University Setif 1, Algeria, from Oct 2020]
 Mehdi El Krari [École centrale de Lille, from Sep 2020]
 Natividad Gonzalez Blanco [University of Sevilla, Spain, From March to May 2020]
 Daniel Pereda Herrera [University of Chile, until Mar 2020]
2 Overall objectives
2.1 Introduction
INOCS is a crossborder “FranceBelgium” project team in the Applied Mathematics Computation and Simulation INRIA domain. The main goal of this team is the study of optimization problems involving complex structures. The scientific objectives of INOCS are related to modeling and methodological concerns. The INOCS team will focus on:
 integrated models for problems with complex structure (CS) taking into account the whole structure of the problem;
 on the development of solution methods taking explicitly into account the nature and the structure of the decisions as well as the properties of the problem.
Even if CS problems are in general NPhard due to their complex nature, exact solution methods or matheuristics (heuristics based on exact optimization methods) will be developed by INOCS. The scientific contribution of INOCS will result in a toolbox of models and methods to solve challenging real life problems.
2.2 Schedule of tasks
The research program development of INOCS is to move alternatively:
 from problems towards new approaches in optimization: Models and solution algorithms will be developed to fit the structure and properties of the problem. From them, new generic approaches will be used to optimize problems with similar properties.
 from innovative approaches towards problems: The relevance of the proposed approaches will be assessed by designing new models and/or solution methods for various classes of problems. These models and methods will be based on the extension and integration of specific, well studied, models and methods.
Even if these two axes are developed sequentially in a first phase, their interactions will lead us to explore them jointly in the midterm.
3 Research program
3.1 Introduction
An optimization problem consists in finding a best solution from a set of feasible solutions. Such a problem can be typically modeled as a mathematical program in which decision variables must (i) satisfy a set of constraints that translate the feasibility of the solution and (ii) optimize some (or several) objective function(s). Optimization problems are usually classified into strategic, tactical and operational problems, according to types of decision to be taken.
We consider that an optimization problem presents a complex structure (CS) when it involves decisions of different types/nature (i.e. strategic, tactical or operational) and/or presents some hierarchical leaderfollower structure. The set of constraints may usually be partitioned into global constraints, linking variables associated with the different types/nature of decision, and constraints involving each type of variables separately. Optimization problems with complex structure lead to extremely challenging problems since a global optimum with respect to the whole sets of decision variables and of constraints must be determined.
Significant progress has been made in optimization to solve academic problems. Nowadays largescale instances of some $NP$hard problems are routinely solved to optimality. Our vision within INOCS is to make the same advances while addressing CS optimization problems. To achieve this goal we aim to develop global solution approaches at the opposite of the current trend. INOCS team members have already proposed some successful methods following this research lines to model and solve CS problems (e.g. ANR project RESPET, Brotcorne et al. 51, 52, Gendron et al. 53, 54, 55, and Strack et al. 56). However, these are preliminary attempts and a number of challenges regarding modeling and methodological issues have still to be met.
3.2 Modeling problems with complex structures
A classical optimization problem can be formulated as follows:
In this problem, $X$ is the set of feasible solutions. Typically, in mathematical programming, $X$ is defined by a set of constraints. $x$ may be also limited to nonnegative integer values.
INOCS team plan to address optimization problem where two types of decision are addressed jointly and are interrelated. More precisely, let us assume that variables $x$ and $y$ are associated with these decisions. A generic model for CS problems is the following:
In this model, $X$ is the set of feasible values for $x$. $XY$ is the set of feasible values for $x$ and $y$ jointly. This set is typically modeled through linking constraints. Last, $Y\left(x\right)$ is the set of feasible values for $y$ for a given $x$. In INOCS, we do not assume that $Y\left(x\right)$ has any properties.
The INOCS team plans to model optimization CS problems according to three types of optimization paradigms: large scale complex structures optimization, bilevel optimization and robust/stochastic optimization. These paradigms instantiate specific variants of the generic model.
Large scale complex structures optimization problems can be formulated through the simplest variant of the generic model given above. In this case, it is assumed that $Y\left(x\right)$ does not depend on $x$. In such models, $X$ and $Y$ are associated with constraints on $x$ and on $y$, $XY$ are the linking constraints. $x$ and $y$ can take continuous or integer values. Note that all the problem data are deterministically known.
Bilevel programs allow the modeling of situations in which a decisionmaker, hereafter the leader, optimizes his objective by taking explicitly into account the response of another decision maker or set of decision makers (the follower) to his/her decisions. Bilevel programs are closely related to Stackelberg (leaderfollower) games as well as to the principalagent paradigm in economics. In other words, bilevel programs can be considered as demandoffer equilibrium models where the demand is the result of another mathematical problem. Bilevel problems can be formulated through the generic CS model when $Y\left(x\right)$ corresponds to the optimal solutions of a mathematical program defined for a given $x$, i.e. $Y\left(x\right)=argmin\left\{h(x,y)y\in {Y}_{2},(x,y)\in X{Y}_{2}\right\}$ where ${Y}_{2}$ is defined by a set of constraints on $y$, and $X{Y}_{2}$ is associated with the linking constraints.
In robust/stochastic optimization, it is assumed that the data related to a problem are subject to uncertainty. In stochastic optimization, probability distributions governing the data are known, and the objective function involves mathematical expectation(s). In robust optimization, uncertain data take value within specified sets, and the function to optimize is formulated in terms of a minmax objective typically (the solution must be optimal for the worstcase scenario). A standard modeling of uncertainty on data is obtained by defining a set of possible scenarios that can be described explicitly or implicitly. In stochastic optimization, in addition, a probability of occurrence is associated with each scenario and the expected objective value is optimized.
3.3 Solving problems with complex structures
Standard solution methods developed for CS problems solve independent subproblems associated with each type of variables without explicitly integrating their interactions or integrating them iteratively in a heuristic way. However these subproblems are intrinsically linked and should be addressed jointly. In mathematicaloptimization a classical approach is to approximate the convex hull of the integer solutions of the model by its linear relaxation. The main solution methods are (1) polyhedral solution methods which strengthen this linear relaxation by adding valid inequalities, (2) decomposition solution methods (Dantzig Wolfe, Lagrangian Relaxation, Benders decomposition) which aim to obtain a better approximation and solve it by generating extreme points/rays. Main challenges are (1) the analysis of the strength of the cuts and their separations for polyhedral solution methods, (2) the decomposition schemes and (3) the extreme points/rays generations for the decomposition solution methods.
The main difficulty in solving bilevel problems is due to their non convexity and non differentiability. Even linear bilevel programs, where all functions involved are affine, are computationally challenging despite their apparent simplicity. Up to now, much research has been devoted to bilevel problems with linear or convex follower problems. In this case, the problem can be reformulated as a singlelevel program involving complementarity constraints, exemplifying the dual nature, continuous and combinatorial, of bilevel programs.
4 Application domains
4.1 Energy
In energy, the team mainly focuses on pricing models for demand side management, on bids definition in the Energy market and on the design and pricing of electric cars charging stations.
Demand side management methods are traditionally used to control electricity demand which became quite irregular recently and resulted in inefficiency in supply. We have explored the relationship between energy suppliers and customers who are connected to a smart grid. The smart grid technology allows customers to keep track of hourly prices and shift their demand accordingly, and allows the provider to observe the actual demand response to its pricing strategy. We tackle pricing problems in energy according to the bilevel optimization approaches. Some research works in this domain are supported by bilateral grants with EDF.
The increasing number of agents, with different characteristics) interacting on the energy market leads to the definition of new types of bidding process. We have modeled this problem has a bilevel one where the lower lever is the instance allocating the bids (the ISO).
The proliferation of electric cars in cities has lead to the challenging problem of designing and pricing charging stations in order to smooth the demand over time. We are modeling this problem as a bilevel one where the lower lever represents the choice of users in a preference list.
4.2 Transportation and Logistics
In transportation and logistics, the team addresses mainly integrated problems, which require taking into account simultaneously different types of decision. Examples are location and routing, inventory management and routing or staff scheduling and warehouse operations management. Such problems occur from the supply chain design level to the logistic facility level.
4.3 Telecommunications
In telecommunications, the team mainly focuses on network design problems and on routing problems. Such problems are optimization problems with complex structure, since the optimization of capacity installation and traffic flow routing have to be addressed simultaneously.
5 Highlights of the year
5.1 Awards
 Yuan Yuan has received the FR TTM (Transports Terrestres et Mobilité) best thesis award
6 New software and platforms
6.1 New software
6.1.1 GroupTesting
 Keywords: Linear optimization, Group Testing

Functional Description:
Group testing is a screening strategy that involves dividing a population into several disjointed groups of subjects. In its simplest implementation, each group is tested with a single test in the first phase, while in the second phase only subjects in positive groups, if any, need to be tested again individually.
To contribute to the effort to tackle the COVID19 sanitary crisis, we developed this software which allows to create groups of a individuals to test via the group testing technique while minimizing a linear combination of the expected number of false negative and false positive classifications.
The test design problem is modeled as a constrained shortest path problem on a specific graph and we design and implement an ad hoc algorithm to solve this problem. We validate the algorithm on instances based on Santé Publique France data on Covid19 screening tests.
 Contacts: Diego Cattaruzza, Tifaout Almeftah, Kaba Keita, Frederic Semet, Luce Brotcorne, Bernard Fortz, Martine Labbé
6.1.2 INOCSBox
 Keywords: Linear optimization, Operational research, Toolbox

Functional Description:
This software is a toolbox that contains algorithms that are frequently used to solve optimization problems tackled by (but not only) the team.
The objective of the toolbox is to contain a set of code skeletons that allow researchers to integrate adequate data structures and basic algorithms for different structures complexity that appears in the optimization problems we study. The current version of the toolbox contains classical heuristic tools (generic local search) to solve, among others, the vehicle rouring problem and its variants. It also contain a code to exactly and heuristically solve the Shortest Path Problem with Ressource Constraints that is usually encountered in the resolution of problem with BranchandPrice algorithms.
The future objective is to include automatic reformulation tools for bilevel optimization problems and stateoftheart codes for the development of decomposition methods.
 Contacts: Diego Cattaruzza, Tifaout Almeftah, Bernard Fortz, Frederic Semet, Luce Brotcorne
7 New results
7.1 Large scale complex structure optimization
Joint order batching and picker routing problem
Order picking is the process of retrieving products from inventory. It is mostly done manually by dedicated employees called pickers and is considered the most expensive of warehouse operations. To reduce the picking cost, customer orders can be grouped into batches that are then collected by traveling the shortest possible distance. We propose an exponential linear programming formulation to tackle the joint order batching and picker routing problem. Variables, or columns, are related to the picking routes in the warehouse. Computing such routes is generally an intractable routing problem and relates to the well known traveling salesman problem (TSP). Nonetheless, the rectangular warehouse's layouts can be used to efficiently solve the corresponding TSP and take into account in the development of an efficient subroutine, called oracle. We therefore investigate whether such an oracle allows for an effective exponential formulation. Experimented on a publicly available benchmark, the algorithm proves to be very effective. It improves many of the best known solutions and provides very strong lower bounds. Finally, this approach is also applied to the HappyChic industrial case to demonstrate its interest for this field of application 16.
Twoechelon distribution in city logistics
In order to avoid trucks entering the city centers, two stage delivery systems are used in city logistics. First, goods are delivered by trucks to depots/hubs located in the outskirts of the city. Then, ecofriendly vehicles are used to bring merchandise to final customers located in city centers. On this subject we conducted two research projects. In the first project, we address specifically the case where a (single) city hub is located in the city center. We investigate the synchronization between the two echelons in twoechelon urban distribution systems. The two echelons are synchronized in time but also with regards to the capacity of the city hub. As far as we know, this is the first study considering the latter issue in the context of twoechelon distribution. To deal with the synchronization while optimizing the distribution, we propose a threephase heuristic solution approach. At first, the approach optimizes the distribution for the second echelon. Then, it manages the synchronization. Finally, it optimizes the distribution for the first echelon. Populationbased metaheuristics and integer programs are used. Results show the effectiveness of the method and permit to derive managerial insights on the distribution. Experiments are based on instances generated from the network Wien 25. Although several city authorities have promoted different measures to foster the implementation of small urban consolidation centers in a twotier system, only a few authors have addressed the joint problem of operating these facilities and providing services to customers. In the second project, we show how the problem can be modeled as a new variant of the bin packing, for which we provide a mixed integer programming formulation and two heuristics that are shown to be quite effective in solving efficiently and to near optimality the problem. The application of our approach on real data from the city of Turin puts into highlight the superiority of the consolidation approach, including the bundle of goods from different providers, stockholding and other valueadded logistics services, over the classical singletier approach. In addition, we conduct a thorough analysis of some emerging aspects of the ondemand economy, as the consideration of customers’ preferences and the integration of multiple delivery options 26.
Logistics network design problem
Planning transportation operations within a supply chain is a difficult task that is often outsourced to logistics providers, in practice. At the tactical level, the problem of distributing products through a multiechelon network is defined in the literature as the Logistics Service Network Design Problem (LSNDP). We study a LSNDP variant inspired by the management of restaurant supply chains. In this problem, a third party carrier seeks to costeffectively source and fulfill customer demands of products through a triechelon supply chain composed of suppliers, warehouses, and customers. We propose an exact solution method based on partial Benders decompositions, where the master problem is strengthened by the addition of aggregated information derived from the subproblem. More specifically, we introduce a highlevel dynamic Benders approach where the aggregated information used to strengthen the master is refined iteratively. In an extensive computational study, we demonstrate that our dynamic Benders strategy produces provably highquality solutions and we validate the interest of refining the master problem in the course of a partial Benders decompositionbased scheme 14. However, realistic instances are too large to be solved in acceptable runtimes, we develop a network reduction heuristic inspired by the recent Dynamic Discretization Discovery algorithm. Through an extensive series of experiments carried out on instances based on the operations of an industrial partner, we demonstrate the efficiency of the proposed approach. We also investigate the impact of the distribution strategy used in practice to determine the transportation plan and how this distribution strategy can be modified to reduce the overall logistics cost 13.
Network design covering problems
Infrastructure network design constitutes a major step in the planning of a transportation network whose purpose is to improve the mobility of the inhabitants of a city or metropolitan area. Since it is generally too expensive to connect all the existing facilities, one must determine a subnetwork that serves at best the traffic demand. Depending on the application, different optimality measures can be considered. In the area of passengers transportation, the aim is to get the infrastructure close to potential customers. In this framework, the goal may be to minimize the maximum routing cost for an origin destination pair when using the new network. Alternatively, the traffic between an origin and a destination may be considered as captured if the cost or travel time when using the network is not larger than the cost or travel time of the best alternative solution (not using the new network). In this case, one might select a sub(network) from an underlying network with the aim of capturing or covering as much traffic for a reasonable construction cost. 41 is devoted to this problem, called the Maximum Covering Network Design Problem (MC) as well as to the closely related problem called, Partial Covering Network Design Problem (PC), in which one minimizes the network design cost for building the network under the constraint that a minimum percentage of the total traffic demand is covered. After presenting models for problems (MC) and (PC), we propose exact methods based on Benders decomposition. Our computational experiments show that our Benders implementations are competitive with exact and nonexact methods in the literature.
Generalized routing problems
We study routing problems that arise in the context of last mile delivery when multiple delivery options are proposed to the customers. The most common option to deliver packages is home/workplace delivery. Besides, the delivery can be made to pickup points such as dedicated lockers or stores. In recent years, a new concept called trunk/incar delivery has been proposed. Here, customers' packages can be delivered to the trunks of cars. Our goal is to model and develop efficient solution approaches for routing problems in this context, in which each customer can have multiple shipping locations. First, we study the singlevehicle case in the considered context, which is modeled as a Generalized Traveling Salesman Problem with Time Windows (GTSPTW). Four mixed integer linear programming formulations 27, 29 and an efficient branchandcut algorithm are proposed 28. Then, we study the multivehicle case which is denoted Generalized Vehicle Routing Problem with Time Windows (GVRPTW). An efficient column generation based heuristic is proposed to solve it 36.
Agriculture robot routing problem
To date, the research on agriculture vehicles in general and Agriculture Mobile Robots (AMRs) in particular has focused on a single vehicle (robot) and its agriculturespecific capabilities. The potential impact of automating AMR fleet coordination on commercial agriculture is immense. Major conglomerates with large and heterogeneous fleets of agriculture vehicles could operate on huge land areas without human operators to effect precision farming. In this project, we consider the Agriculture Fleet Vehicle Routing Problem (AFVRP) which, to the best of our knowledge, differs from any other version of the Vehicle Routing Problem studied so far. We focus on the dynamic and decentralised version of this problem applicable in environments involving multiple agriculture machinery and farm owners where concepts of fairness and equity must be considered. Such a problem combines three related problems: the dynamic assignment problem, the dynamic 3index assignment problem and the capacitated arc routing problem. We review the stateoftheart and categorize solution approaches as centralised, distributed and decentralised, based on the underlining decisionmaking context and discuss open challenges in applying distributed and decentralised coordination approaches to this problem 24, 30.
Group design in group testing for COVID19
Group testing is a screening strategy that involves dividing a population into several disjointed groups of subjects. In its simplest implementation, each group is tested with a single test in the first phase, while in the second phase only subjects in positive groups, if any, need to be tested again individually. In this project, we address the problem of group testing design, which aims to determine a partition into groups of a finite population in such a way that cardinality constraints on the size of each group and a constraint on the expected total number of tests are satisfied while minimizing a linear combination of the expected number of false negative and false positive classifications. First, we show that the properties and model introduced by Aprahmian et al. 49 can be extended to the group test design problem, which is then modeled as a constrained shortest path problem on a specific graph. We design and implement an ad hoc algorithm to solve this problem. On instances based on Santé Publique France data on Covid19 screening tests, the results of the computational experiments are very promising 37.
Home Chemotherapy Planning
In many other countries home chemotherapy is a rising trend. Home chemotherapy services aim to assist cancer patients to remain safe and comfortable in their own homes while continuing to receive their treatment, avoiding hospitalization or admission to outpatient chemotherapy facilities. Home chemotherapy also contributes to the employability of patients, enabling them to remain active for longer periods and with better health conditions. Besides increasing the comfort of the patients, home chemotherapy may help relieve congestion in outpatient chemotherapy services. At the operational level, a complex scheduling problem underlies the daily home chemotherapy planning process. It calls for the determination of an integrated drug production and administration schedule. Indeed, injectable preparations for cancer treatment have a short stability time, i.e. they may expire within a few hours after their production start time. Consequently, they may not be produced ahead of time and then stored. The resulting absence of inventories implies that the production of drugs has to be carefully scheduled jointly with their administration. To address this integrated problem, we use a variable neighborhood search that iteratively creates new drug production schedules meant to relax as much as possible the constraints imposed on the administration operations due to production start times. A local search component mainly concentrates on optimizing the administration sequences, while a linear program is used to find optimal start times for drug production and administration each time a promising set of sequences is found 32.
Discrete Ordered Median Problem
The discrete ordered median problem consists in locating $p$ facilities in order to minimize an ordered weighted sum of distances between clients and closest open facility. We formulate this problem as a set partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then, we apply a branchpriceandcut algorithm to solve small to large sized instances of DOMP in competitive computational time 19.
Segmented isotonic regression
The segmented isotonic regression problem consists in fitting a curve to a cloud of data points under the conditions that the fitted curve must be nonincreasing (or nondecreasing) and piecewise constant (or, equivalently, stepwise), with a predefined limited number of pieces (also referred to as steps or blocks in what follows). This problem is inspired by the bidding rules that large consumers or a pool of small consumers must comply with when participating in an electricity market. Their bids for purchasing electricity in these markets must be often submitted in the form of a nonincreasing stepwise priceconsumption curve, for which the maximum number of bid blocks is also constrained. These curves reflect how consumers value electricity and therefore, their sensitivity to its price (which is referred to as consumers' elasticity). With the advent of Information and Communications Technologies and the rollout of the socalled smart grids, small consumers of electricity are being provided with the means to actively adjust their consumption in response to the electricity price. However, their consumption patterns are still uncertain, dynamic and affected by other factors different from the electricity price. The result is that estimating a bidding curve that properly reflects consumers' sensitivity to the electricity price is a statistical challenge.
In 42, we provide an algorithm to efficiently computes that curve from a set of priceconsumption observations. To ease the computational burden of the proposed algorithm, we develop various strategies to efficiently calculate upper and lower bounds that substantially reduce the number of paths to be explored. Numerical results reveal that our algorithm is able to provide the globally optimal monotone stepwise curve for samples with thousands of data points in less than a few hours.
Finding the root graph through minimum edge deletion
Given a graph, its line graph is anothegraph whose vertices are the edges of the original one. Further an edge links two nodes of the line graph if and only if the corresponding edges of the original graph share a node. A graph is said to be lineinvertible if it is isomorphic to the line graph of some other graph, called the root. Although obtaining the line graph of a given graph is straightforward, doing the reverse is not a trivial task.
In genetics, haplotypes codify certain regions of the genome that show a statistically significant variability within a population. It has been observed that such variability plays an important role in human variation and genetic diseases. Haplotype phasing consists of estimating the haplotypes that produced a current population of genotypes, and is a primary problem in the analysis of genetic data. In this context, consistency relations between genotypes that could have been originated from a common ancestor are codified by a graph. Root graph reconstruction is useful here to estimate the original population size, that is, the number of generating haplotypes. However, if all the consistency relations are considered, sometimes reconstruction from the graph is not possible. In other words, the graph encoding consistency relations is not lineinvertible. In these cases, one needs to disregard some of these relations, that is, to delete some of the edges of the consistency graph. A combinatorial problem then arises, namely which edges to remove so that the graph is disrupted as little as possible. In 22, we study the problem of identifying a set of edges of minimum cardinality that have to be deleted from a graph so that it becomes lineinvertible. We propose different integer linear programming models as well as valid inequalities to strengthen them. Our computational experiments allow empirical comparison between the different models and ultimately demonstrate their utility.
7.2 Bilevel Programming
Pricing for Energy Management
Power systems face higher flexibility requirements from generation to consumption due to the increasing penetration of noncontrollable distributed renewable energy. In this context, demand side management aims at reducing excessive load fluctuation and match the price of energy to their real cost for the grid. Pricing models for demand side management methods are traditionally used to control electricity demand. First, we proposed bilevel pricing models to explore the relationship between energy suppliers and customers who are connected to a smart grid. The smart grid technology allows customers to keep track of hourly prices and shift their demand accordingly, and allows the provider to observe the actual demand response to its pricing strategy. Moreover, we assumed that the smart grid optimizes the usage of a renewable energy generation source and a storage capacity. Results over a rolling horizon were obtained (Léonard Von Niederhausern PhD thesis 57). Next, we considered four types of actors: furnishers sell electricity, local agents trade and consume energy, aggregators trade energy and provide energy to endusers, who consume it. This gives rise to three levels of optimization. The interaction between aggregators and their endusers is modeled with a bilevel program, and so is the interaction between furnishers, and local agents and aggregators. Since solving bilevel programs is difficult in itself, solving trilevel programs requires particular care. We proposed three possible approaches, two of them relying on a characterization of the intermediary optimization level 12, 57. Finally, Time andLevelofUse is a recently proposed energy pricing scheme, designed for the residential sector and providing suppliers with robust guarantee on the consumption. We formulate the supplier decision as a bilevel, biobjective problem optimizing for both financial loss and guarantee. A decomposition method is proposed, related to the optimal value transformation. It allows for the computation of an exact solution by finding possible Pareto optimal candidate solutions and then eliminating dominated ones. Numerical results on experimental residential power consumption data show the method effectively finds the optimal candidate solutions while optimizing costs only or incorporating risk aversion at the lowerlevel 15.
Linear bilevel optimization
One of the most frequently used approaches to solve linear bilevel optimization problems consists in replacing the lowerlevel problem with its Karush–Kuhn–Tucker (KKT) conditions and by reformulating the KKT complementarity conditions using techniques from mixedinteger linear optimization. The latter step requires to determine some big$M$ constant in order to bound the lower level's dual feasible set such that no bileveloptimal solution is cut off. In practice, heuristics are often used to find a big$M$ although it is known that these approaches may fail. In 21, we consider the hardness of two proxies for the above mentioned concept of a bilevelcorrect big$M$. First, we prove that verifying that a given big$M$ does not cut off any feasible vertex of the lower level's dual polyhedron cannot be done in polynomial time unless $P=NP$. Second, we show that verifying that a given big$M$ does not cut off any optimal point of the lower level's dual problem (for any point in the projection of the highpoint relaxation onto the leader’s decision space) is as hard as solving the original bilevel problem. Similarly to mixedinteger programming, valid inequalities could be used to provide tighter relaxations of bilevel problems by cutting off bilevelinfeasible points, i.e. points that violate optimality of the lowerlevel problem. However, for linear bilevel problems not many tailored valid inequalities are known. In 20, we derive such a valid inequality for linear bilevel problems by exploiting the strongduality condition of the lowerlevel problem. This primaldual inequality turns out to be very effective for some instances.
Product pricing
One of the main concerns in management and economic planning is to sell the right product to the right customer for the right price. Companies in retail and manufacturing employ pricing strategies to maximize their revenues.
In the Rank Pricing Problem (RPP), a firm intends to maximize its profit through the pricing of a set of products to sell. Customers are interested in purchasing at most one product among a subset of products. To do so, they are endowed with a ranked list of preferences and a budget. Their choice rule consists in purchasing the highestranked product in their list and whose price is below their budget. In 44, we consider an extension of RPP, the Rank Pricing Problem with Ties (RPPT), in which we allow for indifference between products in the list of preferences of the customers. We propose different mixed integer programming formulations for the problem and valid inequalities to strengthen them. Computational experiments assess the performance of the proposed approaches.
Next, in 18, we analyze a product pricing problem with singleminded customers, each interested in buying a bundle of products. The objective is to maximize the total revenue and we assume that supply is unlimited for all products. We contribute to a missing piece of literature by giving some mathematical formulations for this singleminded bundle pricing problem. We first present a mixedinteger nonlinear program with bilinear terms in the objective function and the constraints. By applying classical linearization techniques, we obtain two different mixedinteger linear programs. We then study the polyhedral structure of the linear formulations and obtain valid inequalities based on an RLTlike framework. We develop a Benders decomposition to project strong cuts from the tightest model onto the lighter models. We conclude this work with extensive numerical experiments to assess the quality of the mixedinteger linear formulations, as well as the performance of the cutting plane algorithms and the impact of the preprocessing on computation times.
Bilevel Minimum Spanning Tree Problem
Consider a graph $G$ whose edge set is partitioned into a set of red edges and a set of blue edges, and assume that red edges are weighted and contain a spanning tree of $G$. Then, the Bilevel Minimum Spanning Tree Problem (BMSTP) consists in pricing (i.e. weighting) the blue edges in such a way that the total weight of the blue edges selected in a minimum spanning tree of the resulting graph is maximized. We propose different mathematical formulations for the BMSTP based on the properties of the Minimum Spanning Tree Problem and the bilevel optimization. We establish a theoretical and empirical comparison between these new formulations and we also provide reinforcements that together with a proper formulation are able to solve medium to big size instances 23.
Bilevel programming models for location problems
First, we addressed a multiproduct location problem in which a retail firm has several malls with a known location. A particular product comes in p types. Each mall has a limited capacity for products to be sold at that location, so the firm has to choose what products to sold at what mall. Furthermore, the firm can apply discrete levels of discount on the products. The objective of the firm is to find what products to sell at which mall, with what level of discount, so that its profit is maximized. Consumers are located in points of the region. Each consumer has a different set of acceptable products, and will purchase one of these, or none if it is not convenient for her. Consumers maximize their utility. The agents (firm and consumers) play a Stackelberg game, in which the firm is the leader and the customers the follower. Once the firm decides the products to sell at each mall and the possible discounts, consumers purchase (or not) one of their acceptable products wherever their utility is maximized. We model the problem using bilevel formulations, which are compared on known instances from the literature 43.
Bilevel programming models for the design and pricing of electric cars charging stations
We address the problem of locating, designing and pricing electric car charging stations by explicitly integrating the preferences of the users into the decision making process. More precisely we consider a strategicoperational decision making process whose goal is to generate revenue and smooth out the demand over time. This last objective is a very important one in the current context of renewable energy production uncertainty. The problem is modeled as a bilevel one. The users behviour is represented by a choice in a preference list defined according to treshold values on prices and distances. Integer variables can be relaxed in the lower level problem. The bilevel model is reformulated as a single level MIP program. Numerical results are provided on randomly generated instances.
Stackelberg games
We formulate a Stackelberg Security game that coordinates resources in a border patrol problem. In this security domain, resources from different precincts have to be paired to conduct patrols in the border due to logistic constraints. Given this structure the set of pure defender strategies is of exponential size. We describe the set of mixed strategies using a polynomial number of variables but exponentially many constraints that come from the matching polytope. We then include this description in a mixed integer formulation to compute the Strong Stackelberg Equilibrium efficiently with a branch and cut scheme. Since the optimal patrol solution is a probability distribution over the set of exponential size, we also introduce an efficient sampling method that can be used to deploy the security resources every shift. Our computational results evaluate the efficiency of the branch and cut scheme developed and the accuracy of the sampling method. We show the applicability of the methodology by solving a real world border patrol problem 17.
Mixed integer programming techniques bilevel optimization
The scientific interest in computational bilevel optimization increased a lot over the last decade and is still growing. Independent of whether the bilevel problem itself contains integer variables or not, many stateoftheart solution approaches for bilevel optimization make use of techniques that originate from mixedinteger programming. These techniques include branchandbound methods, cutting planes and, thus, branchandcut approaches, or problem specific decomposition methods. In 46, we review bileveltailored approaches that exploit these mixedinteger programming techniques to solve bilevel optimization problems.
7.3 Robust/Stochastic programming
Complexity of deciding feasibility of a booking in the European Gas Market
During the last decades, the European gas market has undergone ongoing liberalization, resulting in the socalled entryexit market system. The main goal of this market reorganization is the decoupling of trading and actual gas transport. To achieve this goal within the European entryexit market, gas traders interact with transport system operators (TSOs) via bookings and nominations. A booking is a capacityright contract in which a trader reserves a maximum injection or withdrawal capacity at an entry or exit node of the TSO’s network. On a dayahead basis, these traders are then allowed to nominate an actual load flow up to the booked capacity. To this end, the traders specify the actual amount of gas to be injected to or withdrawn from the network such that the total injection and withdrawal quantities are balanced. On the other hand, the TSO is responsible for the transport of the nominated amounts of gas. By having signed the booking contract, the TSO guarantees that the nominated amounts can actually be transported through the network. More precisely, the TSO needs to be able to transport every set of nominations that complies with the signed booking contracts. Thus, an infinite number of possible nominations must be anticipated and checked for feasibility when the TSO accepts bookings. As a consequence, the entryexit market decouples trading and transport. However, it also introduces many new challenges, e.g. the checking of feasibility of bookings or the computation of bookable capacities on the network.
Deciding the feasibility of a booking can be seen as an adjustable robust feasibility problem, where the set of bookingcompliant nominations is the uncertainty set. The feasibility of a booking, if the underlying network is a tree, can be decided in polynomial time. In 47, we extend the knowledge on the frontier of hardness by showing that deciding the feasibility of a booking on singlecycle networks is in $P$. We analyze the structure of potential difference maximizing nominations by exploiting the cyclic structure of the network as well as techniques specific to potentialbased flow models. Interestingly, this allows to reduce the task of checking the feasibility of a booking to checking the solvability of a system of polynomial equalities and inequalities in fixed dimension, where the latter does not depend on the size of the cycle.
Robust bilevel programs
Bilevel optimization problems embed the optimality conditions of a subproblem into the constraints of a decisionmaking process. A general question of bilevel optimization occurs where the lowerlevel is solved (only) to nearoptimality. Solving bilevel problems under limited deviations of the lowerlevel variables was introduced under the term “$\u03f5$approximation” of the pessimistic bilevel problem. In 58 the authors define special properties and a solution method for this variant in the socalled independent case, i.e. where the lowerlevel feasible set is independent of the upperlevel decision. In 50, we generalized the approach of 58, to problems with constraints involving upper and lowerlevel variables in the constraints at both levels. The purpose of this generalization is to protect the upperlevel feasibility against uncertainty of nearoptimal solutions of the lowerlevel. We call this nearoptimal robustness and the generalization is a nearoptimal robust bilevel problem (NORBiP). NORBiP is a bilinear bilevel problem, and this makes it very hard in general. We have defined and implemented a solution algorithm for the linear linear NORBiP 50.
8 Bilateral contracts and grants with industry
8.1 Bilateral contracts with industry
Utocat (201802020): Study optimization problems arising in the blockchain
8.2 Bilateral grants with industry
 Program PGMO funded by the Fondation Mathématiques Jacques Hadamard. EDF is the industrial partner (2017–2019)
 Program PGMO funded by the Fondation Mathématiques Jacques Hadamard. A generic framework for routing and scheduling problems (2019–2021)
 Program PGMO funded by the Fondation Mathématiques Jacques Hadamard. Integrated models for the dimensioning and location of charging electric vehicles stations in the presence of renewable energy sources: Models and Algorithms (2019–2020)
9 Partnerships and cooperations
9.1 International initiatives
9.1.1 Inria International Labs
BIOSEL — BIlevel Optimization in Security, Energy and Logistics
Participants: Martine Labbé.
 Duration: 2020 – 2022
 Partners: Industrial Engineering, Pontifical Catholic University of Chile (Chile)
 Summary: This projet is devoted to bilevel optimisation problems with application in the security, energy, and logistics domains. Stackelberg games, including one defender and several followers, bidding problems in energy supply markets and product selection problems will be considered. Mixed integer optimisation models and efficient algorithms to solve them will be developed.
9.1.2 Inria associate team not involved in an IIL
LOBI — Learning au sein de l'Optimisation BIniveau
Participants: Diego Cattaruzza.
 Duration: 2018 – 2020
 Partners: Polytechnique Montréal (Canada)
 Summary: The interplay between optimization and machine learning is one of the most important developments in modern computational science. Simultaneously there is a tremendous increase in the availability of large quantities of data in a multitude of applications, and a growing interest in exploiting the information that this data can provide to improve decisionmaking. Given the importance of big data in business analytics, its explicit integration into an optimization process is a challenge with high potential impact. The innovative project is concerned with the interconnection between machine learning approaches and a particular branch of optimization called bilevel optimization in this “big data” context. More precisely, we will focus on the development of new approaches integrating machine learning within bilevel optimization (LOBI: “Learning au sein de l'Optimisation BIniveau”) for two important practical applications, the pricing problem in revenue management and the energy ressource aggregation problem in smart grids. The applications arise from current industry collaborations of the teams involved, and will serve as testbeds to demonstrate the potential impact of the proposed approach.
9.1.3 Participation in other international programs
CityFreight — Freight logistics in sustainable cities
Participants: Frédéric Semet.
 Duration: 2020 – 2024
 Partners: University of Bergen – Centre for Climate and Energy Transformation, The Norwegian Public Roads Administration, Sparebanken Vest, City of Bergen, Vestland County, Bergen Chamber of Commerce and Industry, Nordic Edge AS (Norway); Centrale Lille; The Polytechnic University of Turin (Italy); Sichuan University, Chengdu (China)
 Funding type: Knowledgebuilding project for industry, Research Council of Norway (RCN).
 Summary: The primary objective of this project is to provide public authorities, particularly in smaller, topologically complicated, cities and initially the City of Bergen, with a toolbox for realistically evaluating major decisions that would make a city more energy efficient and sustainable in terms of freight transportation.
9.2 International research visitors
9.2.1 Visits of international scientists
 Natividad Gonzalez Blanco, University of Sevilla (Spain), March – May 2020
9.2.2 Visits to international teams
Research stays abroad
 Bernard Fortz visited CIRRELT, Montreal (Canada), February 2020
9.3 European initiatives
9.3.1 FP7 & H2020 Projects
 H2020LCGV2019: “Large demonstratIoN of user CentrIc urban and longrange charging solutions to boosT an engaging deployment of Electric Vehicles in Europe (INCITEV)” subcontractor of the Polytechnic University of Turin, Italy for the pricing problem of electric car charging. (2019 – 2023)
9.3.2 Collaborations in European programs, except FP7 and H2020
 CHISTERA SECOREA project: “Supporting Energy CommunitiesOperational Research and Energy Analytics”. (2020 – 2023)
9.4 National initiatives
9.4.1 ANR
ANR project AGIRE — Decision system for smart management of resources in warehouses
In collaboration with Ecole des Mines de SaintEtienne (Gardanne), IFSTTAR (ChampssurMarne), HappyChic (Tourcoing).
This project addresses human resources management in warehouses which supply either sale points (B2B) or final consumers (B2C). Nowadays, such warehouses are under pressure. This is mainly due to the no inventory policy at the sale points and to the constant growth of ecommerce sales in France and Europe. In terms of logistics, this translates into an increasing number of parcels to prepare and to ship to satisfy an order, which is known typically a few hours before. Moreover, the total number of products to be packed varies very significantly from daytoday by a factor of at least 3 (https://
The novelty of the project is twofold: (1) The human factor is explicitly be taken into account. It is integrated in the mathematical models and algorithms that are developed for the project. The aim is to improve the quality of employees' work ensuring the efficiency of the logistic system; (2) Problems at different decision levels are integrated and tackled jointly. At the tactical level, the main problematics are workload smoothing and the management of the storage zone. At operational level, the major issues concern the rearrangement of the picking zone, the picking tours, and the dynamic reorganization of activities to manage uncertainties.
9.4.2 F.R.S.FNRS (Belgium)
Bilevel optimization is a branch of mathematical optimization that deals with problems whose constraints embed an auxiliary optimization problem. The F.R.S.FNRS research project “bilevel optimization” (2018 – 2020) will study such bilevel problems with bilinear objectives and simple second level problems. Each follower chooses one strategy in a given fixed set of limited size. Two classes of such problems will be studied: Pricing Problems and Stackelberg Security Games.
In pricing problems, prices for products must be determined to maximize the revenue of a leader given specific behaviors of customers (followers). More precisely, we will consider the single minded pricing problem and the rank pricing problem.
In Stackelberg games, mixed strategies to cover targets, must be determined in order to maximize the defender expected payoff given that attackers (followers) attack targets that maximize their own payoffs.
9.5 Regional initiatives
9.5.1 CPER — Projet ELSAT 2020
Hybrid approaches in logistics, transportation and mobility
A hybrid approach is a method in which we try to combine as well as possible the components of several (at least two) resolution approaches from several communities: exact methods, heuristics, metaheuristics. In this project, we are interested in hybrid methods known as matheuristics based on mathematical programming and techniques resulting from metaheuristics. Our work focuses on theoretical and methodological aspects to allow the emergence of new and efficient methods to tackle challenging and (very) large optimization problems. Such methods are applied to the solution of transportation problems that arise particularly in city logistics.
10 Dissemination
10.1 Promoting scientific activities
10.1.1 Scientific events: organisation
General chair, scientific chair
 INOCS team has organised the ORBEL (Belgium OR Society) conference, Lille, January 30–31, 2020: chairs Diego Cattaruzza, Maxime Ogier.
Member of the organizing committees
 Networks and Optimization Workshop, Lecce Italy, June 2020 (canceled): Frédéric Semet
10.1.2 Scientific events: selection
Member of the conference program committees
 Transportation Science and Logistics Society Conference, Arlington, USA, May 2020 (canceled): Luce Brotcorne, Frédéric Semet
 LII Brazilian Symposium on Operational Research (LII SBPO), Jao Pessoa, Brazil, November 2020: Martine Labbé
 ISCO 2020: International Symposium on Combinatorial Optimization, Montreal, Canada, May 2020: Martine Labbé
 ROADEF 2020: 21st annual congress of Société française de recherche opérationelle et aide à la décision, Montpellier, February 2020: Luce Brotcorne, Diego Cattaruzza, Frédéric Semet
10.1.3 Journal
Member of the editorial boards
 Computers and Operations Research: Luce Brotcorne — Member of the Editorial Advisory Board
 EURO Journal on Computational Optimization: Martine Labbé — Editor in chief, Bernard Fortz — Editor
 International Transactions in Operations Research: Bernard Fortz, Martine Labbé — Associate editors
 INFORMS Journal on Computing: Bernard Fortz — Associate editor
 Transportation Science: Martine Labbé — Member of the Advisory Board
 Open Journal of Mathematical Optimization: Martine Labbé — Member of the steering committee
Reviewer  reviewing activities
Annals of Operations Research, Applied Computing and Informatics, Central European Journal of Operations Research, Computers & Operations Research, Computational Optimization and Applications, Discrete Applied Mathematics, EURO Journal on Transportation and Logistics, European Journal of Operational Research, IISE Transactions, INFORMS Journal on Computing, International Journal of Management Science and Engineering Management, Mathematical Programming Computation, Networks, Omega, Operations Research, Optimization and Engineering, RAIRO  Operations Research, Transportation Science, IEEE Transactions on Power Systems, IEEE Transactions on Smart Grids, IEEE Power Engineering Letters: Luce Brotcorne, Diego Cattaruzza, Bernard Fortz, Martine Labbé, Maxime Ogier, Frédéric Semet.
10.1.4 Invited talks
 Martine Labbé was invited speaker at the ALOP Autumn school on Bilevel Optimization, October 2020.
 Bernard Fortz was keynote speaker at the INFORMS Telecommunications and Network Analytics Conference, October 2020.
10.1.5 Leadership within the scientific community
 EURO Working Group “Pricing and Revenue Management”: Luce Brotcorne — coordinator
 EURO Working Group “European Network Optimization Group (ENOG)”: Bernard Fortz — coordinator
 EURO Working Group “Vehicle routing and logistics optimization (VEROLOG)”: Frédéric Semet — Member of the board
 ORBEL (Belgian Operations Research Society): Bernard Fortz — Member of the board of administration
 CNRS GdR 3002: Operations Research: Frédéric Semet — Member of the steering committee
10.1.6 Scientific expertise
 IVADO International consultative committee, Montreal, Canada: Martine Labbé — member
 NSERC Civil, Industrial and Systems Engineering Evaluation Group, Canada: Bernard Fortz — member
 CIRRELT scientific orientation committee, Montreal, Canada: Bernard Fortz, Frédéric Semet — members
 Logistics in Wallonia, Internal Selection Committee, Belgium: Bernard Fortz — member
 Scientific committee of FranceNetherlands Exchange Program: Luce Brotcorne — member
 Nouvelle Aquitaine Region: Frédéric Semet — reviewer.
10.1.7 Research administration
 Committee for the Technological Development (CDT): Luce Brotcorne — President
 INRIA evaluation commission — Luce Brotcorne — Member
 CRIStAL: Frédéric Semet — Deputydirector
 Scientific council of Centrale Lille: Diego Cattaruzza — Elected member
 Scientific council of OPTIMA thematic group of CRIStAL: Diego Cattaruzza — Member
10.2 Teaching  Supervision  Juries
10.2.1 Teaching
 Master: Bernard Fortz, Recherche Opérationnelle et Applications, 30hrs, M1, University of Mons (Charleroi campus), Belgium
 Master: Bernard Fortz, Continuous Optimization, 24hrs, M1 & M2, VU Brussels, Belgium
 Master: Frédéric Semet, Nonlinear Optimization, 30hrs, M2, Centrale Lille
 Master: Frédéric Semet, Operations Research, 28hrs, M2, Centrale Lille
 Master: Luce Brotcorne, Optimisation, 14hrs, M1, Polytech Lille
 Master: Luce Brotcorne, Recherche opérationnelle, 16hrs, M1 apprentissage, Polytech Lille
 Master: Diego Cattaruzza, Maxime Ogier, Frédéric Semet, Prescriptive analytics and optimization, 64hrs, M1, Centrale Lille
 Master: Diego Cattaruzza, Maxime Ogier, ObjectOriented Programming, 48hrs, M1, Centrale Lille
 Master: Diego Cattaruzza, Maxime Ogier, Operations Research, 16hrs, M1, Centrale Lille
 Licence: Diego Cattaruzza, Maxime Ogier, ObjectOriented Programming, 36hrs, L3, Centrale Lille
 Licence: Frédéric Semet, Advanced programming and Complexity, 24hrs, L3, Centrale Lille
 Licence: Diego Cattaruzza, Maxime Ogier, ObjectOriented Programming, 40hrs, L2, Centrale Lille
 Licence: Bernard Fortz, Algorithmique 1, 12hrs, L1, VU Brussels, Belgium
 Licence: Bernard Fortz, Algorithmique et Recherche Opérationnelle, 24hrs, L3, VU Brussels, Belgium
10.2.2 Supervision
 PhD: Mathieu Besançon, Approche biniveau de réponse à la demande dans les réseaux électriques intelligents, from September 2018 to December 2020, Miguel Anjos, Luce Brotcorne, Frédéric Semet
 PhD: Yaheng Cui, Models and methods for decentralized decision in logistics networks, from Oct 2016 to December 2020, Luce Brotcorne, Eric Ballot
 PhD in progress: Thibault Prunet, Human aware storage assignement picking routing problems, from February 2020, Nabil Absi, Valeria Borodin, Diego Cattaruzza
 PhD in progress: Matteo Petris, Column generation approaches for integrated operationnal problems, from October 2019, Diego Cattaruzza, Maxime Ogier, Frédéric Semet
 PhD in progress: Moises Rodriguez Madrena, Problems in data analysis and location theory, from January 2019, Martine Labbé, Justo Puerto
 PhD in progress: Luis Alberto Salazar Zendeja, Formulations and resolution methods for network interdiction problems, from November 2018, Diego Cattaruzza, Martine Labbé, Frédéric Semet
 PhD in progress: Concepción Domínguez Sánchez, Mixed integer linear models and algorithms for pricing problems, from October 2017, Martine Labbé
 PhD in progress: Jérôme De Boeck, Optimization problems in energy, from October 2015, Bernard Fortz
 PhD in progress: Fränk Plein, Models and methods for the robust verification of booked capacities in gas networks in a decentralized setting, from October 2017, Martine Labbé, Martin Schmidt
10.2.3 Juries
 D. Kadnikov, PhD, Ecole des Ponts, Paris, 2020, “Games in Intrinsic Form with Witsenhausen Model”: Luce Brotcorne (member)
 Edouard Leurent, PhD, Université de Lille, 2020, “Safe and Efficient Reinforcement Learning for Behavioural Planning in Autonomous Driving”: Luce Brotcorne (member)
 Amine Mohamed Falek, PhD, Université de Strasbourg, 2020, “Efficient Route Planning for Dynamic & Multimodal Transportation Networks”: Diego Cattaruzza (member)
 Lucie Pansart, PhD, Université Grenoble Alpes, 2020, “Algorithmes de chemin élémentaire : application aux échanges de reins”: Maxime Ogier (member)
 Adrien Cambier, PhD, Avignon Université, 2020, “Planification optimale des réseaux mobiles”: Bernard Fortz (reviewer)
 José Miguel Quesada Pérez, PhD, UC Louvain, Belgium, 2020, “Express Shipment Service Network Design: Multiple Hubs, Complex Routes and Demand Uncertainty”: Bernard Fortz (member)
 Walid Klibi, HdR, Université de Bordeaux, 2020, “The Design of Robust ValueCreating Supply Chain Networks under Uncertainty”: Frédéric Semet (member)
10.3 Popularization
10.3.1 Interventions
Innovation research network days (Journées du réseau de recherche sur l'innovation; RRI) Lille, November 2020, “De l'entrepôt au client final: exemples d'optimisation de la chaîne logistique”, Luce Brotcorne
11 Scientific production
11.1 Major publications
 1 article A heuristic branchcutandprice algorithm for the ROADEF/EURO challenge on Inventory Routing Transportation Science 2019
 2 article Achieving an optimal tradeoff between revenue and energy peak within a smart grid environment Renewable Energy March 2016
 3 articleBenders Decomposition for the HopConstrained Survivable Network Design ProblemINFORMS Journal on Computing2512013, 1326URL: http://joc.journal.informs.org/content/25/1/13.abstract
 4 article A Trilevel Model for Best Response in Energy DemandSide Management European Journal of Operational Research 2020
 5 articleAn exact algorithm for the network pricing problemDiscrete Optimization822011, 246258URL: https://dx.doi.org/10.1016/j.disopt.2010.09.003
 6 articleJoint design and pricing on a networkOperation Research562008, 11041115URL: https://dx.doi.org/10.1287/opre.1080.0617
 7 articleStrengthened Formulations and Valid Inequalities for Single Delay Management in Public TransportationTransportation Science5352019, 12131499
 8 articleA Lagrangian heuristic algorithm for the timedependent combined network design and routing problemNetworks6912017, 110123URL: http://dx.doi.org/10.1002/net.21721
 9 articleStochastic binary problems with simple penalties for capacity constraints violationsMathematical Programming138122013, 199221URL: http://dx.doi.org/10.1007/s1010701205204
 10 articleIntegrated Shift Scheduling and Load Assignment Optimization for Attended Home DeliveryTransportation Science532019, 9171212
11.2 Publications of the year
International journals
 11 articleA heuristic branchcutandprice algorithm for the ROADEF/EURO challenge on Inventory RoutingTransportation Science5422020, 299564
 12 articleA Trilevel Model for Best Response in Energy DemandSide ManagementEuropean Journal of Operational Research28122020, 299315
 13 article A TimeExpanded Network Reduction Matheuristic for the Logistics Service Network Design Problem Transportation Research Part E: Logistics and Transportation Review 147 102203 March 2021
 14 articleA Benders decompositionbased approach for logistics service network designEuropean Journal of Operational Research2862October 2020, 523537
 15 articleA Bilevel Approach for Optimal PriceSetting of TimeandLevelofUse TariffsIEEE Transactions on Smart Grid116November 2020, 54625465
 16 articleAn efficient and general approach for the joint order batching and picker routing problemEuropean Journal of Operational Research2852September 2020, 497512
 17 article Coordinated defender strategies for border patrols European Journal of Operational Research 2021
 18 article Models and Algorithms for the Product Pricing with SingleMinded Customers Requesting Bundles Computers and Operations Research November 2020
 19 article A BranchPriceandCut Procedure for the Discrete Ordered Median Problem INFORMS Journal on Computing 2021
 20 article Closing the Gap in Linear Bilevel Optimization: A New Valid PrimalDual Inequality Optimization Letters November 2020
 21 article There's No Free Lunch: On the Hardness of Choosing a Correct BigM in Bilevel Optimization Operations Research 68 6 2020
 22 article Finding the root graph through minimum edge deletion European Journal of Operational Research 2020
 23 article Computational comparisons of different formulations for the Bilevel Minimum Spanning Tree Problem International Transactions in Operational Research 2021
 24 articleAgriculture fleet vehicle routing: A decentralised and dynamic problemAI Communications341February 2021, 5571
 25 articleTwoechelon distribution with a single capacitated city hubEURO Journal on Transportation and Logistics93September 2020, 100015
 26 articleA new model for LastMile Delivery and Satellite Depots management: The impact of the ondemand economyTransportation Research Part E: Logistics and Transportation Review145January 2021, 102184
 27 article Mixed integer programming formulations for the generalized traveling salesman problem with time windows 4OR: A Quarterly Journal of Operations Research 2021
 28 article A branchandcut algorithm for the generalized traveling salesman problem with time windows European Journal of Operational Research 286 3 November 2020
 29 articleA note on the lifted MillerTuckerZemlin subtour elimination constraints for routing problems with time windowsOperations Research Letters482March 2020, 167169
International peerreviewed conferences
 30 inproceedings On MultiAgent Coordination of AgriRobot Fleets Eleventh International Workshop on Agents in Traffic and Transportation Santiago de Compostela, Spain September 2020
Conferences without proceedings
 31 inproceedings Multiperiod distribution network planning with capacity reservation contracts ORBEL 34: 34th Annual Conference of the Belgium Operational Research Society Lille, France January 2020
 32 inproceedings Integrated Production Scheduling and Vehicle Routing for Home Chemotherapy Planning ORBEL34 Lille, France January 2020
 33 inproceedings Global optimization approaches to design a hybrid railway power station ORBEL 34  34th Annual Conference of the Belgian Operational Research Society Lille, France January 2020
 34 inproceedings Models and Algorithms for Network Interdiction Problems ROADEF 2020  21ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision Montpellier, France February 2020
 35 inproceedings Models and Algorithms of the Minimum Spaning Tree Interdiction Problem ORBEL 34: 34th Annual Conference of the Belgium Operational Research Society Lille, France January 2020
 36 inproceedings Last mile delivery with multiple shipping options ORBEL 34: 34th Annual Conference of the Belgium Operational Research Society Lille, France January 2020
Reports & preprints
 37 report Group design in group testing for COVID19 : A French casestudy INRIA  Centre Lille Nord Europe November 2020
 38 misc Complexity of nearoptimal robust versions of multilevel optimization problems February 2021
 39 report Indicateurs de suivi de l'activité scientifique de l'Inria Inria December 2020
 40 reportStationary Strong Stackelberg Equilibrium in Discounted Stochastic GamesInriaMarch 2021, 62
 41 misc Benders decomposition for Network Design Covering Problems February 2021
 42 misc A dynamic programming approach to segmented isotonic regression December 2020
 43 misc Product line optimization with multiples sites November 2020
 44 misc The Rank Pricing Problem with Ties July 2020
 45 misc A sequential approach for a multicommodity twoechelon distribution problem March 2021
 46 misc A Survey on MixedInteger Programming Techniques in Bilevel Optimization January 2021
 47 misc Deciding Feasibility of a Booking in the European Gas Market on a Cycle is in P for the Case of Passive Networks October 2020
 48 misc Bilevel Optimization Approaches to Decide the Feasibility of Bookings in the European Gas Market January 2021
11.3 Cited publications
 49 articleOptimal RiskBased Group TestingManagement Science6592018, 43654384
 50 unpublishedNearoptimal robust bilevel optimizationNovember 2019, working paper or preprint
 51 articleA Tabu search algorithm for the network pricing problemComput. Oper. Res.39112012, 26032611URL: https://doi.org/10.1016/j.cor.2012.01.005
 52 articleAn exact algorithm for the network pricing problemDiscret. Optim.822011, 246258URL: https://doi.org/10.1016/j.disopt.2010.09.003
 53 articleBenders, metric and cutset inequalities for multicommodity capacitated network designComput. Optim. Appl.4232009, 371392URL: https://doi.org/10.1007/s1058900791220
 54 article01 reformulations of the multicommodity capacitated network design problemDiscret. Appl. Math.15762009, 12291241URL: https://doi.org/10.1016/j.dam.2008.04.022
 55 articleFormulations and relaxations for a multiechelon capacitated locationdistribution problemComput. Oper. Res.3652009, 13351355URL: https://doi.org/10.1016/j.cor.2008.02.009
 56 inproceedings Heuristic Approaches for Integrated Production and Distribution Planning International Conference on Industrial Engineering and Systems Management URL: https://hal.archivesouvertes.fr/hal01255550
 57 phdthesis Design and pricing of new energy services in a competitive environment Ecole Centrale de Lille April 2019
 58 articlePessimistic bilevel optimizationJournal on Optimization232013, 353380