Sanjay Dominik Jena
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sanjay Dominik Jena has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Andrea Lodi
Cornell Tech and Technion–IIT
3 shared publications Bernard Gendron
Department of Computer Science and Operations Research Université de Montréal Montreal Quebec Canada
3 shared publications- Claudio Sole
Canada Excellence Research Chair in Data-Science for Real-time Decision-Making, Polytechnique Montréal, Montréal, Quebec H3T 1J4, Canada
2 shared publications - Gabriel Homsi
Department of Computer Science and Operations Research Université de Montréal Montreal Quebec Canada
2 shared publications - Jiaqi Liang
Dpartement de Mathmatiques et Gnie Industriel, Polytechnique Montreal, Montreal, QC, Canada
2 shared publications - Margarida Carvalho
Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport and Département d’informatique et de recherche opérationnelle, Université de Montréal, Montréal, Québec H3T 1J4, Canada
2 shared publications
Latest Publications
- Open Access
Retrospective population-based cohorts for assessing the performance of algorithmic diabetes classification and for quantifying the true burden of type 1, type 2 and LADA phenotypes in Quebec: a study protocol
Introduction: Diabetes affects 537 million people worldwide, with type 2 diabetes (T2D) estimated to account for most cases. Type 1 diabetes (T1D), latent autoimmune diabetes in adults (LADA) and other specific types due to other causes remain under-recognised, especially LADA, given the absence of a standardised definition. In the province of Quebec (Canada), no population-based prevalence and incidence estimates are available for all diabetes phenotypes. Current medico-administrative algorithms fail to distinguish among diabetes subtypes, limiting accurate surveillance and effective prevention and clinical strategies. Methods and analysis: This retrospective, longitudinal study (1997-2027) will be conducted in Quebec. Phase 1 will assess classification performance of the Corsenac et al. (2022) medico-administrative algorithms. Diagnostic performance metrics will be calculated per phenotype (T1D, T2D, LADA and others), using three independent subsamples as references in a first cohort (A1-A2-A3; n≈5200). It composed respectively of: (A1) self-reported diagnoses of T1D and LADA; (A2) diagnoses of T2D and other specific types due to others causes, confirmed by a physician; and (A3) general population respondents reporting diabetes status and phenotypes (if applicable). Subsamples are structured to capture the diversity and relative proportions of diabetes phenotypes, ensuring sufficient statistical power for population-based and subgroup analyses. All records (A1, A2, A3) will be probabilistically linked with medico-administrative and pharmaceutical claims from the Régie de l’assurance maladie du Québec (RAMQ) by the Institut de la statistique du Québec (ISQ). Machine learning methods will be then applied to refine algorithmic definitions for the four phenotypes (T1D, T2D, LADA, others). In phase 2, refined algorithms will be applied to a second medico-administrative population-based cohort, named C (n=50 000) to produce the first simultaneous prevalence and incidence estimates for the four phenotypes. Analyses will be restricted to individuals continuously covered by RAMQ’s public drug insurance, which provides pharmaceutical data and covers 46% of the Quebec population. Calibration on population margins (phase 1) and standardised inverse probability weighting (phase 2) will reweight estimates (performance metrics in phase 1 and frequencies in phase 2) to represent the general Quebec population. Ethics and dissemination: The different ethics boards of partner institutions approved the feasibility of the study. The study was registered on ClinicalTrials.gov, NCT06573905 . Results will be disseminated through scientific and public health channels.
Open AccessRetrospective population-based cohorts for assessing the performance of algorithmic diabetes classification and for quantifying the true burden of type 1, type 2 and LADA phenotypes in Quebec: a study protocol
Introduction: Diabetes affects 537 million people worldwide, with type 2 diabetes (T2D) estimated to account for most cases. Type 1 diabetes (T1D), latent autoimmune diabetes in adults (LADA) and other specific types due to other causes remain under-recognised, especially LADA, given the absence of a standardised definition. In the province of Quebec (Canada), no population-based prevalence and incidence estimates are available for all diabetes phenotypes. Current medico-administrative algorithms fail to distinguish among diabetes subtypes, limiting accurate surveillance and effective prevention and clinical strategies. Methods and analysis: This retrospective, longitudinal study (1997-2027) will be conducted in Quebec. Phase 1 will assess classification performance of the Corsenac et al. (2022) medico-administrative algorithms. Diagnostic performance metrics will be calculated per phenotype (T1D, T2D, LADA and others), using three independent subsamples as references in a first cohort (A1-A2-A3; n≈5200). It composed respectively of: (A1) self-reported diagnoses of T1D and LADA; (A2) diagnoses of T2D and other specific types due to others causes, confirmed by a physician; and (A3) general population respondents reporting diabetes status and phenotypes (if applicable). Subsamples are structured to capture the diversity and relative proportions of diabetes phenotypes, ensuring sufficient statistical power for population-based and subgroup analyses. All records (A1, A2, A3) will be probabilistically linked with medico-administrative and pharmaceutical claims from the Régie de l’assurance maladie du Québec (RAMQ) by the Institut de la statistique du Québec (ISQ). Machine learning methods will be then applied to refine algorithmic definitions for the four phenotypes (T1D, T2D, LADA, others). In phase 2, refined algorithms will be applied to a second medico-administrative population-based cohort, named C (n=50 000) to produce the first simultaneous prevalence and incidence estimates for the four phenotypes. Analyses will be restricted to individuals continuously covered by RAMQ’s public drug insurance, which provides pharmaceutical data and covers 46% of the Quebec population. Calibration on population margins (phase 1) and standardised inverse probability weighting (phase 2) will reweight estimates (performance metrics in phase 1 and frequencies in phase 2) to represent the general Quebec population. Ethics and dissemination: The different ethics boards of partner institutions approved the feasibility of the study. The study was registered on ClinicalTrials.gov, NCT06573905 . Results will be disseminated through scientific and public health channels.
- Open Access
Stackelberg Dynamic Location Planning under Cumulative Demand
Dynamic facility location problems predominantly suppose a monopoly over the service or product provided. Nonetheless, this premise can be a severe oversimplification in the presence of market competitors, as customers may prefer facilities installed by one of them. The monopolistic assumption can particularly worsen planning performance when demand depends on prior location decisions of the market participants, namely, when unmet demand from one period carries over to the next. Such a demand behaviour creates an intrinsic relationship between customer demand and location decisions of all market participants, and requires the decision-maker to anticipate the competitor's response. This work studies a novel competitive facility location problem that combines cumulative demand and market competition to devise high-quality solutions. We propose bilevel mixed-integer programming formulations for two variants of our problem, prove that the optimistic variant is $Σ^{p}_{2}$-hard, and develop branch-and-cut algorithms with tightened value-function cuts that significantly outperform general-purpose bilevel solvers. Our results quantify the severe cost of planning under a monopolistic assumption (profit drops by half on average) and the gains from cooperation over competition (6% more joint profit), while drawing managerial guidelines on how instance attributes and duopolistic modelling choices shape robust location schedules.
Open AccessStackelberg Dynamic Location Planning under Cumulative Demand
Dynamic facility location problems predominantly suppose a monopoly over the service or product provided. Nonetheless, this premise can be a severe oversimplification in the presence of market competitors, as customers may prefer facilities installed by one of them. The monopolistic assumption can particularly worsen planning performance when demand depends on prior location decisions of the market participants, namely, when unmet demand from one period carries over to the next. Such a demand behaviour creates an intrinsic relationship between customer demand and location decisions of all market participants, and requires the decision-maker to anticipate the competitor's response. This work studies a novel competitive facility location problem that combines cumulative demand and market competition to devise high-quality solutions. We propose bilevel mixed-integer programming formulations for two variants of our problem, prove that the optimistic variant is $Σ^{p}_{2}$-hard, and develop branch-and-cut algorithms with tightened value-function cuts that significantly outperform general-purpose bilevel solvers. Our results quantify the severe cost of planning under a monopolistic assumption (profit drops by half on average) and the gains from cooperation over competition (6% more joint profit), while drawing managerial guidelines on how instance attributes and duopolistic modelling choices shape robust location schedules.
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (1) , 46-63
Dynamic Facility Location Under Cumulative Customer Demand
Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. The existing literature commonly assumes that customer demand quantities are defined independently for each time period. In many planning contexts, however, unmet demand carries over to future time periods. Unmet demand at some time periods may, therefore, affect decisions of subsequent time periods. This work studies a novel location problem, where the decision maker places facilities over time to capture cumulative customer demand. We propose two mixed-integer programming formulations for this problem, and we show that one of them has a tighter continuous relaxation and allows the representation of more general customer demand behavior. We characterize the computational complexity for this problem and analyze which problem characteristics result in NP hardness. We then propose an exact branch-and-Benders-cut method and show that this method is approximately five times faster, on average, than solving the tighter formulation directly in our computational experiments. Our results also quantify the benefit of accounting for cumulative customer demand within the optimization framework because the corresponding planning solutions perform much better than those obtained by ignoring cumulative demand or employing myopic heuristics. We also draw managerial insights on the quality of service perceived by customers when the provider places facilities under cumulative customer demand. Funding: This work was supported by the Fonds de recherche du Québec [Grant FRQ-Institut de valorisation des données Research Chair], IVADO [Grant FRQ-IVADO Research Chair], and the Natural Sciences and Engineering Research Council of Canada [Grants 2017-05224 and 2024-04051]. Additionally, this work was funded by the Fonds de recherche du Québec - Nature et Technologie [Grant Doctoral Scholarship B2X-328911], and this research was enabled in part by support provided by Calcul Québec and the Digital Research Alliance of Canada. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2025.0104 .
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (1) , 46-63
Dynamic Facility Location Under Cumulative Customer Demand
Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. The existing literature commonly assumes that customer demand quantities are defined independently for each time period. In many planning contexts, however, unmet demand carries over to future time periods. Unmet demand at some time periods may, therefore, affect decisions of subsequent time periods. This work studies a novel location problem, where the decision maker places facilities over time to capture cumulative customer demand. We propose two mixed-integer programming formulations for this problem, and we show that one of them has a tighter continuous relaxation and allows the representation of more general customer demand behavior. We characterize the computational complexity for this problem and analyze which problem characteristics result in NP hardness. We then propose an exact branch-and-Benders-cut method and show that this method is approximately five times faster, on average, than solving the tighter formulation directly in our computational experiments. Our results also quantify the benefit of accounting for cumulative customer demand within the optimization framework because the corresponding planning solutions perform much better than those obtained by ignoring cumulative demand or employing myopic heuristics. We also draw managerial insights on the quality of service perceived by customers when the provider places facilities under cumulative customer demand. Funding: This work was supported by the Fonds de recherche du Québec [Grant FRQ-Institut de valorisation des données Research Chair], IVADO [Grant FRQ-IVADO Research Chair], and the Natural Sciences and Engineering Research Council of Canada [Grants 2017-05224 and 2024-04051]. Additionally, this work was funded by the Fonds de recherche du Québec - Nature et Technologie [Grant Doctoral Scholarship B2X-328911], and this research was enabled in part by support provided by Calcul Québec and the Digital Research Alliance of Canada. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2025.0104 .
- Open Access
- 4 October 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 185
Mitigating choice model ambiguity: A consensus framework and its application to assortment optimization
- 4 October 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 185
Open AccessMitigating choice model ambiguity: A consensus framework and its application to assortment optimization
- Open Access
- 16 July 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
Solving multi-stage stochastic facility location problems with modular capacity adjustments
- 16 July 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
Open AccessSolving multi-stage stochastic facility location problems with modular capacity adjustments
- Open Access
- 22 November 2024
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 13
Dynamic rebalancing for Bike-sharing systems under inventory interval and target predictions
- 22 November 2024
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 13
Open AccessDynamic rebalancing for Bike-sharing systems under inventory interval and target predictions
- Open Access
- 17 September 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 173
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage
- 17 September 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 173
Open AccessA slope scaling heuristic for the multi-period strategic planning of carbon capture and storage
- 28 June 2024
- Published by Springer Nature
- p. 77-114
Facility Location: A Guide to Modeling and Solving Complex Problem Variants via Lagrangian Relaxation Heuristics
- 28 June 2024
- Published by Springer Nature
- p. 77-114
Facility Location: A Guide to Modeling and Solving Complex Problem Variants via Lagrangian Relaxation Heuristics
- Open Access
- 6 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 317 (3) , 875-889
Dynamic rebalancing optimization for bike-sharing systems: A modeling framework and empirical comparison
- 6 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 317 (3) , 875-889
Open AccessDynamic rebalancing optimization for bike-sharing systems: A modeling framework and empirical comparison