Miguel F. Anjos
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
Miguel F. Anjos has a total of 150 co-authors. Here are the top co-authors by number of shared publications:
- Luce Brotcorne
INOCS Team, INRIA Lille-Nord Europe, Villeneuve d’Ascq, France
7 shared publications - Gómez-Herrera Juan Alejandro
Department of Mathematics and Industrial Engineering, Polytechnique Montreal, Montreal, QC, Canada
6 shared publications - Sébastien Le Digabel
GERAD and Department of Mathematics and Industrial Engineering Polytechnique Montréal. 6079 Succ. Centre-ville Montréal H3C 3A7 Québec Canada
6 shared publications - Anthony Vannelli
Department of Mathematical and Statistical Sciences, University of Colorado Denver, CO, United States
5 shared publications - Manuel V. C. Vieira
NOVAMath and Mathematics Department, NOVA School of Science and Technology, Caparica, Portugal
5 shared publications - Michel Gendreau
Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Montréal, Canada
5 shared publications
Latest Publications
- 10 November 2026
- Published by Elsevier in International Journal of Production Economics
- Vol. 304
Optimal investment in pooled maintenance resources under uncertain demand for multi-site production
- 10 November 2026
- Published by Elsevier in International Journal of Production Economics
- Vol. 304
Optimal investment in pooled maintenance resources under uncertain demand for multi-site production
- Open Access
- 20 February 2026
- Published by Springer Nature in Computational Management Science
- Vol. 23 (1) , 11
A stochastic programming model for planning CO2 transport infrastructure with uncertainty
Due to the long duration of Carbon Capture and Storage projects and the uncertainty of the captured $$\text {CO}_{2}$$ amounts, making decisions about the construction of transport infrastructure in the early stages is challenging. The objective of this study is to propose a stochastic programming model to optimize the deployment of infrastructure, specifically pipelines and ships, to transport $$\text {CO}_{2}$$ from industrial sources to sequestration sites. The proposed model accounts for uncertainties in the capture (or supply) of $$\text {CO}_{2}$$ and is tested using an illustrative case study of the Humber cluster in the UK. The constructed scenario trees incorporate the risk of potential closure and reactivation of the capture facilities, allowing decision makers to make more robust first stage decisions about the type and capacity of transport infrastructure to construct. The experiments in this paper examine changes in optimal investment decision for a range of uncertainties. For example, the trade-off between investment in pipelines and ships is influenced by assumptions about the potential for ships to relocate to other regions if CCS projects close and key policy decisions (e.g. availability of upfront funding for infrastructure investment). For our illustrative case study, pipelines are preferred in cases with lower probabilities of closure in later periods when sufficient budget is available. When a higher probability of project closure is considered or discount rate is increased to typical commercial rates, our model indicates that investment in ships will dominate.- 20 February 2026
- Published by Springer Nature in Computational Management Science
- Vol. 23 (1) , 11
Open AccessA stochastic programming model for planning CO2 transport infrastructure with uncertainty
Due to the long duration of Carbon Capture and Storage projects and the uncertainty of the captured $$\text {CO}_{2}$$ amounts, making decisions about the construction of transport infrastructure in the early stages is challenging. The objective of this study is to propose a stochastic programming model to optimize the deployment of infrastructure, specifically pipelines and ships, to transport $$\text {CO}_{2}$$ from industrial sources to sequestration sites. The proposed model accounts for uncertainties in the capture (or supply) of $$\text {CO}_{2}$$ and is tested using an illustrative case study of the Humber cluster in the UK. The constructed scenario trees incorporate the risk of potential closure and reactivation of the capture facilities, allowing decision makers to make more robust first stage decisions about the type and capacity of transport infrastructure to construct. The experiments in this paper examine changes in optimal investment decision for a range of uncertainties. For example, the trade-off between investment in pipelines and ships is influenced by assumptions about the potential for ships to relocate to other regions if CCS projects close and key policy decisions (e.g. availability of upfront funding for infrastructure investment). For our illustrative case study, pipelines are preferred in cases with lower probabilities of closure in later periods when sufficient budget is available. When a higher probability of project closure is considered or discount rate is increased to typical commercial rates, our model indicates that investment in ships will dominate. - 18 February 2026
- Published by Springer Nature
- p. 41-65
Design of Poisoning Attacks on Linear Regression Using Bilevel Optimization
- 18 February 2026
- Published by Springer Nature
- p. 41-65
Design of Poisoning Attacks on Linear Regression Using Bilevel Optimization
- Open Access
- 11 September 2025
- Published by Springer Nature in Optimization and Engineering
- Vol. 27 (3) , 1-37
Green hydrogen viability in the transition to a fully-renewable energy grid
With the transition to a fully renewable energy grid arises the need for a green source of stability and baseload support, which classical renewable generation such as wind and solar cannot offer due to their uncertain and highly-variable generation. In this paper, we study whether green hydrogen can close this gap as a source of supplemental generation and storage. We design a two-stage mixed-integer stochastic optimization model that accounts for uncertainties in renewable generation. Our model considers the investment in renewable plants and hydrogen storage, as well as the operational decisions for running the hydrogen storage systems. For the data considered, we observe that a fully renewable network driven by green hydrogen has a greater potential to succeed when wind generation is high. In fact, the main investment priorities revealed by the model are in wind generation and in liquid hydrogen storage. This long-term storage is more valuable for taking full advantage of hydrogen than shorter-term intraday hydrogen gas storage. In addition, we note that the main driver for the potential and profitability of green hydrogen lies in the electricity demand and prices, as opposed to those for gas. Our model and the investment solutions proposed are robust with respect to changes in the investment costs. All in all, our results show that there is potential for green hydrogen as a source of baseload support in the transition to a fully renewable-powered energy grid.
- 11 September 2025
- Published by Springer Nature in Optimization and Engineering
- Vol. 27 (3) , 1-37
Open AccessGreen hydrogen viability in the transition to a fully-renewable energy grid
With the transition to a fully renewable energy grid arises the need for a green source of stability and baseload support, which classical renewable generation such as wind and solar cannot offer due to their uncertain and highly-variable generation. In this paper, we study whether green hydrogen can close this gap as a source of supplemental generation and storage. We design a two-stage mixed-integer stochastic optimization model that accounts for uncertainties in renewable generation. Our model considers the investment in renewable plants and hydrogen storage, as well as the operational decisions for running the hydrogen storage systems. For the data considered, we observe that a fully renewable network driven by green hydrogen has a greater potential to succeed when wind generation is high. In fact, the main investment priorities revealed by the model are in wind generation and in liquid hydrogen storage. This long-term storage is more valuable for taking full advantage of hydrogen than shorter-term intraday hydrogen gas storage. In addition, we note that the main driver for the potential and profitability of green hydrogen lies in the electricity demand and prices, as opposed to those for gas. Our model and the investment solutions proposed are robust with respect to changes in the investment costs. All in all, our results show that there is potential for green hydrogen as a source of baseload support in the transition to a fully renewable-powered energy grid.
- Open Access
- 15 February 2025
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 63 (3) , 439-458
Optimal electric vehicle charging with dynamic pricing, customer preferences and power peak reduction
- 15 February 2025
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 63 (3) , 439-458
Open AccessOptimal electric vehicle charging with dynamic pricing, customer preferences and power peak reduction
- Open Access
- 6 January 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 177
An efficient solution methodology for the airport slot allocation problem with preprocessing and column-and-row generation
- 6 January 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 177
Open AccessAn efficient solution methodology for the airport slot allocation problem with preprocessing and column-and-row generation
- Open Access
- 9 October 2024
- Published by Springer Nature in Mathematical Programming
- Vol. 218 (1-2) , 1-50
Cuts and semidefinite liftings for the complex cut polytope
We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices $$xx^\textrm{H}$$ , where the elements of $$x \in \mathbb {C}^n$$ aremth unit roots. These polytopes have applications in MAX-3-CUT, digital communication technology, angular synchronization and more generally, complex quadratic programming. For $$m=2$$ , the complex cut polytope corresponds to the well-known cut polytope. We generalize valid cuts for this polytope to cuts for any complex cut polytope with finite $$m>2$$ and provide a framework to compare them. Further, we consider a second semidefinite lifting of the complex cut polytope for $$m=\infty $$ . This lifting is proven to be equivalent to other complex Lasserre-type liftings of the same order proposed in the literature, while being of smaller size. Our theoretical findings are supported by numerical experiments on various optimization problems.- 9 October 2024
- Published by Springer Nature in Mathematical Programming
- Vol. 218 (1-2) , 1-50
Open AccessCuts and semidefinite liftings for the complex cut polytope
We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices $$xx^\textrm{H}$$ , where the elements of $$x \in \mathbb {C}^n$$ aremth unit roots. These polytopes have applications in MAX-3-CUT, digital communication technology, angular synchronization and more generally, complex quadratic programming. For $$m=2$$ , the complex cut polytope corresponds to the well-known cut polytope. We generalize valid cuts for this polytope to cuts for any complex cut polytope with finite $$m>2$$ and provide a framework to compare them. Further, we consider a second semidefinite lifting of the complex cut polytope for $$m=\infty $$ . This lifting is proven to be equivalent to other complex Lasserre-type liftings of the same order proposed in the literature, while being of smaller size. Our theoretical findings are supported by numerical experiments on various optimization problems. - Open Access
A Binary Expansion Approach for the Water Pump Scheduling Problem in Large and High-Altitude Water Supply Systems
The water pump scheduling problem is an optimisation model that determines which water pumps will be turned on or off at each time period over a given time horizon for a given water supply system. This problem has received considerable attention in mining and desalination due to the high power consumption of water pumps and desalination plants and the complicated dynamics of water flows and the power market. Motivated by this, in this paper we solve the optimal operation of a desalinated water supply system consisting of interconnected tanks and pumps that transport water to high-altitude reservoirs. The optimisation of this process encounters several difficulties arising from (i) the nonlinearities of the equations for the frictional losses along the pipes and pumps, which makes the problem a nonlinear mixed-integer model, and (ii) many possible combinations of pressure head and flow rates, which quickly leads to high computational costs. These limitations prevent the problem from being solved in a reasonable computational time in high-altitude water supply systems with more than six pumps and reservoirs, as in many networks worldwide. Therefore, in this work we develop new exact methods for the optimal pump scheduling problem that use a binary expansion approach to efficiently account for the existing nonlinearities by reducing the computational difficulties of the original problem while keeping an excellent representation of the physical phenomena involved. We also extensively tested the proposed approach in different network topologies and a case study for a real-world copper mine water network, and we conclude that the binary expansion approach significantly reduces the computational time for solving the problem with high precision, which can be very relevant for the practical daily operation of real-world water supply systems.
Open AccessA Binary Expansion Approach for the Water Pump Scheduling Problem in Large and High-Altitude Water Supply Systems
The water pump scheduling problem is an optimisation model that determines which water pumps will be turned on or off at each time period over a given time horizon for a given water supply system. This problem has received considerable attention in mining and desalination due to the high power consumption of water pumps and desalination plants and the complicated dynamics of water flows and the power market. Motivated by this, in this paper we solve the optimal operation of a desalinated water supply system consisting of interconnected tanks and pumps that transport water to high-altitude reservoirs. The optimisation of this process encounters several difficulties arising from (i) the nonlinearities of the equations for the frictional losses along the pipes and pumps, which makes the problem a nonlinear mixed-integer model, and (ii) many possible combinations of pressure head and flow rates, which quickly leads to high computational costs. These limitations prevent the problem from being solved in a reasonable computational time in high-altitude water supply systems with more than six pumps and reservoirs, as in many networks worldwide. Therefore, in this work we develop new exact methods for the optimal pump scheduling problem that use a binary expansion approach to efficiently account for the existing nonlinearities by reducing the computational difficulties of the original problem while keeping an excellent representation of the physical phenomena involved. We also extensively tested the proposed approach in different network topologies and a case study for a real-world copper mine water network, and we conclude that the binary expansion approach significantly reduces the computational time for solving the problem with high precision, which can be very relevant for the practical daily operation of real-world water supply systems.
- Open Access
- 30 July 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (4) , 813-842
Robust bilevel optimization for near-optimal lower-level solutions
Bilevel optimization problems embed the optimality of a subproblem as a constraint of another optimization problem. We introduce the concept of near-optimality robustness for bilevel optimization, protecting the upper-level solution feasibility from limited deviations from the optimal solution at the lower level. General properties and necessary conditions for the existence of solutions are derived for near-optimal robust versions of general bilevel optimization problems. A duality-based solution method is defined when the lower level is convex, leveraging the methodology from the robust and bilevel literature. Numerical results assess the efficiency of exact and heuristic methods and the impact of valid inequalities on the solution time.
- 30 July 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (4) , 813-842
Open AccessRobust bilevel optimization for near-optimal lower-level solutions
Bilevel optimization problems embed the optimality of a subproblem as a constraint of another optimization problem. We introduce the concept of near-optimality robustness for bilevel optimization, protecting the upper-level solution feasibility from limited deviations from the optimal solution at the lower level. General properties and necessary conditions for the existence of solutions are derived for near-optimal robust versions of general bilevel optimization problems. A duality-based solution method is defined when the lower level is convex, leveraging the methodology from the robust and bilevel literature. Numerical results assess the efficiency of exact and heuristic methods and the impact of valid inequalities on the solution time.
- 28 June 2024
- Published by Springer Nature
- p. 431-448
Integrated Location, Sizing, and Pricing for EV Charging Stations
- 28 June 2024
- Published by Springer Nature
- p. 431-448
Integrated Location, Sizing, and Pricing for EV Charging Stations