Bernard Fortz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bernard Fortz has a total of 75 co-authors. Here are the top co-authors by number of shared publications:
- Luis Gouveia
Faculdade de Ciências da Universidade de Lisboa
12 shared publications - Martine Labbé
Département d'Informatique Université libre de Bruxelles Brussels Belgium
12 shared publications Dimitri Papadimitriou
8 shared publications- Mikkel Thorup
University of Copenhagen, Copenhagen, Denmark
6 shared publications - Michael Poss
LIRMM University of Montpellier CNRS Montpellier France
4 shared publications - Hakan Ümit
Université catholique de Louvain
3 shared publications
Latest Publications
- 4 August 2026
- Published by Elsevier in European Journal of Operational Research
Lifted branching: Learning to improve branching strategies
- 4 August 2026
- Published by Elsevier in European Journal of Operational Research
Lifted branching: Learning to improve branching strategies
- 14 October 2025
- Published by Springer Nature in Public Transport
- Vol. 18 (1) , 29-64
Spot-fare inspection in urban bus transportation systems: strategy and unpredictability under a Stackelberg game approach
- 14 October 2025
- Published by Springer Nature in Public Transport
- Vol. 18 (1) , 29-64
Spot-fare inspection in urban bus transportation systems: strategy and unpredictability under a Stackelberg game approach
- 28 June 2024
- Published by Springer Nature
- p. 149-161
Models for Network Flow and Network Design Problems with Piecewise Linear Costs
- 28 June 2024
- Published by Springer Nature
- p. 149-161
Models for Network Flow and Network Design Problems with Piecewise Linear Costs
- 28 July 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 160
Loads scheduling for demand response in energy communities
- 28 July 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 160
Loads scheduling for demand response in energy communities
- Open Access
- 19 March 2022
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 3 (3)
Transaction fees optimization in the Ethereum blockchain
- 19 March 2022
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 3 (3)
Open AccessTransaction fees optimization in the Ethereum blockchain
- Open Access
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Loads Scheduling for Demand Response in Energy Communities
This paper focuses on optimizing collective self-consumption in an energy community composed of households and premises (stadium) by scheduling loads of electrical appliances owned by the members. The corresponding community remains connected to the public grid, and each member can produce and/or store photovoltaic energy. Furthermore, they can exchange this energy with the public grid or other energy community members. The proposed strategy aims at implementing a Demand Side Management program by taking advantage of the controllable loads' characteristics. A MILP formulation of the problem allows, on the one hand, to give the optimal planning of the operation of the electrical devices. On the other hand, it provides the optimal solutions for managing the storage units and the energy exchanges between community members and the public grid to minimize the energy flows from the public grid to the community over the time horizon. However, this MILP does not allow us to efficiently solve the large instances of the problem. Thus, we develop a column generation-based heuristic to find solutions for large problem instances. Our numerical experiments based on real data collected in the south of France, show that joining an energy community saves money on energy bills and reduces the total energy drawn from the primary grid by at least 15%.
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Open AccessLoads Scheduling for Demand Response in Energy Communities
This paper focuses on optimizing collective self-consumption in an energy community composed of households and premises (stadium) by scheduling loads of electrical appliances owned by the members. The corresponding community remains connected to the public grid, and each member can produce and/or store photovoltaic energy. Furthermore, they can exchange this energy with the public grid or other energy community members. The proposed strategy aims at implementing a Demand Side Management program by taking advantage of the controllable loads' characteristics. A MILP formulation of the problem allows, on the one hand, to give the optimal planning of the operation of the electrical devices. On the other hand, it provides the optimal solutions for managing the storage units and the energy exchanges between community members and the public grid to minimize the energy flows from the public grid to the community over the time horizon. However, this MILP does not allow us to efficiently solve the large instances of the problem. Thus, we develop a column generation-based heuristic to find solutions for large problem instances. Our numerical experiments based on real data collected in the south of France, show that joining an energy community saves money on energy bills and reduces the total energy drawn from the primary grid by at least 15%.
- 29 December 2021
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 95 (3) , 365-407
Strategic bidding in price coupled regions
- 29 December 2021
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 95 (3) , 365-407
Strategic bidding in price coupled regions
- Open Access
Benders decomposition for Network Design Covering Problems
We consider two covering variants of the network design problem. We are given a set of origin/destination pairs, called O/D pairs, and each such O/D pair is covered if there exists a path in the network from the origin to the destination whose length is not larger than a given threshold. In the first problem, called the Maximal Covering Network Design problem, one must determine a network that maximizes the total fulfilled demand of the covered O/D pairs subject to a budget constraint on the design costs of the network. In the second problem, called the Partial Covering Network Design problem, the design cost is minimized while a lower bound is set on the total demand covered. After presenting formulations, we develop a Benders decomposition approach to solve the problems. Further, we consider several stabilization methods to determine Benders cuts as well as the addition of cut-set inequalities to the master problem. We also consider the impact of adding an initial solution to our methods. Computational experiments show the efficiency of these different aspects.
Open AccessBenders decomposition for Network Design Covering Problems
We consider two covering variants of the network design problem. We are given a set of origin/destination pairs, called O/D pairs, and each such O/D pair is covered if there exists a path in the network from the origin to the destination whose length is not larger than a given threshold. In the first problem, called the Maximal Covering Network Design problem, one must determine a network that maximizes the total fulfilled demand of the covered O/D pairs subject to a budget constraint on the design costs of the network. In the second problem, called the Partial Covering Network Design problem, the design cost is minimized while a lower bound is set on the total demand covered. After presenting formulations, we develop a Benders decomposition approach to solve the problems. Further, we consider several stabilization methods to determine Benders cuts as well as the addition of cut-set inequalities to the master problem. We also consider the impact of adding an initial solution to our methods. Computational experiments show the efficiency of these different aspects.