Weiwei Chen
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
Research Subjects
Weiwei Chen has a total of 75 co-authors. Here are the top co-authors by number of shared publications:
- Junming Liu
Department of Information Systems, City University of Hong Kong, Hong Kong SAR, China; and City University of Hong Kong Shenzhen Research Institute, Shenzhen 518057, China
5 shared publications - Dmitry Ivanov
Berlin School of Economics and Law
3 shared publications Lei Lei
3 shared publications- Alexandre Dolgui
IMT Atlantique
2 shared publications - Benjamin Melamed
Department of Supply Chain Management, Rutgers Business School - Newark and New Brunswick, Rutgers University, Piscataway, USA
2 shared publications - Cheng Hua
Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, China
2 shared publications
Latest Publications
- 24 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Fast Filter Pruning Method for Neural Network Compression
The rapid adoption of artificial neural networks has led to the development of increasingly complex and large models. Although these models have achieved outstanding performance across various applications, their deployment and inference speed on devices with limited computing resources pose significant challenges. To address these issues, model compression techniques have been proposed to reduce model size while preserving performance. In this paper, we propose a two-stage filter pruning approach for model compression, designed to maximize filter diversity given a desired compression ratio. We interpret filter diversity from an information theory perspective and propose a combinatorial optimization model that selects a subset of filters aimed at retaining the maximum information of the original network. We frame the maximization of filter diversity as a p-dispersion problem and propose a polynomial-time algorithm that is within a factor of two of the optimal solution. Compared with state-of-the-art benchmarks in automated pruning methods, the proposed algorithm offers significant advantages in computational complexity and solution speed. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72192823, 72301172, 72394370:72394375, and 72495130:72495132], the Shanghai Jiao Tong University Office of Liberal Arts [Grant ZHWK2502], and the Zhejiang Key Laboratory of Decision Intelligence [Grant 2025E10006]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0991 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0991 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 24 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Fast Filter Pruning Method for Neural Network Compression
The rapid adoption of artificial neural networks has led to the development of increasingly complex and large models. Although these models have achieved outstanding performance across various applications, their deployment and inference speed on devices with limited computing resources pose significant challenges. To address these issues, model compression techniques have been proposed to reduce model size while preserving performance. In this paper, we propose a two-stage filter pruning approach for model compression, designed to maximize filter diversity given a desired compression ratio. We interpret filter diversity from an information theory perspective and propose a combinatorial optimization model that selects a subset of filters aimed at retaining the maximum information of the original network. We frame the maximization of filter diversity as a p-dispersion problem and propose a polynomial-time algorithm that is within a factor of two of the optimal solution. Compared with state-of-the-art benchmarks in automated pruning methods, the proposed algorithm offers significant advantages in computational complexity and solution speed. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72192823, 72301172, 72394370:72394375, and 72495130:72495132], the Shanghai Jiao Tong University Office of Liberal Arts [Grant ZHWK2502], and the Zhejiang Key Laboratory of Decision Intelligence [Grant 2025E10006]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0991 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0991 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 8 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Fast Filter Pruning Method for Neural Network Compression
The software and replication materials in this repository are a snapshot of the software and data that were used in the research reported on in the paper Fast Filter Pruning Method for Neural Network Compression by D. Wang, W. Chen, C. Hua, W. Zhou, and X. Lin.
- 8 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Fast Filter Pruning Method for Neural Network Compression
The software and replication materials in this repository are a snapshot of the software and data that were used in the research reported on in the paper Fast Filter Pruning Method for Neural Network Compression by D. Wang, W. Chen, C. Hua, W. Zhou, and X. Lin.
- Open Access
- 26 May 2026
- Published by Springer Nature in Annals of Operations Research
- Vol. 362 (1-3) , 457-482
Enhancing efficiency and workflow in oncology outpatient services through simulation-based optimization
Outpatient chemotherapy clinics face rising demand and growing patient dissatisfaction, creating pressures to improve efficiency while sustaining quality care. This study uses an agent-based simulation of a National Cancer Institute (NCI)-designated cancer center’s infusion clinic to evaluate the effectiveness of three proposed operational changes: setting up an on-site laboratory, adapting nurse staffing based on anticipated demand increases, and balancing appointment scheduling via simulation optimization. The model, calibrated with historical data, tracks patient visit length and nurse utilization. Our study shows that combining an on-site lab with optimized scheduling reduces average visit length by about 75–90 minutes (approximately 30%) under various demand levels, smoothing workflow peaks. The study also shows that modest increases in nursing staff ensure timely patient throughput with 7–10% decreases in nurse utilization. Joint implementation of these operational changes outperforms individual changes, highlighting important synergies and the value of an integrated operations strategy. Overall, the study demonstrates a generalizable simulation-based framework to guide oncology process redesign and strategic decisions such as capacity expansion or facility relocation.
- 26 May 2026
- Published by Springer Nature in Annals of Operations Research
- Vol. 362 (1-3) , 457-482
Open AccessEnhancing efficiency and workflow in oncology outpatient services through simulation-based optimization
Outpatient chemotherapy clinics face rising demand and growing patient dissatisfaction, creating pressures to improve efficiency while sustaining quality care. This study uses an agent-based simulation of a National Cancer Institute (NCI)-designated cancer center’s infusion clinic to evaluate the effectiveness of three proposed operational changes: setting up an on-site laboratory, adapting nurse staffing based on anticipated demand increases, and balancing appointment scheduling via simulation optimization. The model, calibrated with historical data, tracks patient visit length and nurse utilization. Our study shows that combining an on-site lab with optimized scheduling reduces average visit length by about 75–90 minutes (approximately 30%) under various demand levels, smoothing workflow peaks. The study also shows that modest increases in nursing staff ensure timely patient throughput with 7–10% decreases in nurse utilization. Joint implementation of these operational changes outperforms individual changes, highlighting important synergies and the value of an integrated operations strategy. Overall, the study demonstrates a generalizable simulation-based framework to guide oncology process redesign and strategic decisions such as capacity expansion or facility relocation.
- 27 April 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (4) , 608-634
Integrated Planning of Supply and Inventory Under Seasonal Demand Uncertainty
This study investigates several classes of integrated supply and inventory (SI) planning problems, addressing supplier selection with limited or unlimited capacities, distribution, and centralized or decentralized inventory planning for various products with uncertain demand. Our focus is on retailers specializing in fashion products characterized by seasonal demand, extended lead times, and the inability to restock during midselling seasons, requiring salvage of unsold items at diminished returns. We formulate the capacitated problems as convex mixed-integer programs and show they are strongly NP-hard. To address these complex problems, we propose employing Lagrangian relaxation methods for analytically deriving lower bounds, establishing optimal multiplier ranges, and deriving worst-case error bounds. Additionally, we introduce heuristics to generate feasible solutions. Computational studies demonstrate that our relaxation-based heuristics produce solutions closely approaching optimality. Furthermore, we demonstrate that uncapacitated SI problems can be solved analytically, providing closed-form optimal solutions. This research contributes significant managerial insights for practitioners involved in supplier selection, distribution strategies, and inventory management within centralized and decentralized supply chains. Particularly noteworthy are our analytical findings on the benefits of centralization, especially under correlated Gaussian and heavy-tailed stable demand distributions. Our computational experiments further explore the influence of critical factors such as economies of scale, demand correlation, demand distribution characteristics, and upstream and downstream costs. Specifically, we assess how these factors impact the efficacy of centralization versus decentralized inventory management in minimizing expected inventory and overall system costs. Supplemental Material: The online supplement is available at https://doi.org/10.1287/trsc.2025.0026 .
- 27 April 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (4) , 608-634
Integrated Planning of Supply and Inventory Under Seasonal Demand Uncertainty
This study investigates several classes of integrated supply and inventory (SI) planning problems, addressing supplier selection with limited or unlimited capacities, distribution, and centralized or decentralized inventory planning for various products with uncertain demand. Our focus is on retailers specializing in fashion products characterized by seasonal demand, extended lead times, and the inability to restock during midselling seasons, requiring salvage of unsold items at diminished returns. We formulate the capacitated problems as convex mixed-integer programs and show they are strongly NP-hard. To address these complex problems, we propose employing Lagrangian relaxation methods for analytically deriving lower bounds, establishing optimal multiplier ranges, and deriving worst-case error bounds. Additionally, we introduce heuristics to generate feasible solutions. Computational studies demonstrate that our relaxation-based heuristics produce solutions closely approaching optimality. Furthermore, we demonstrate that uncapacitated SI problems can be solved analytically, providing closed-form optimal solutions. This research contributes significant managerial insights for practitioners involved in supplier selection, distribution strategies, and inventory management within centralized and decentralized supply chains. Particularly noteworthy are our analytical findings on the benefits of centralization, especially under correlated Gaussian and heavy-tailed stable demand distributions. Our computational experiments further explore the influence of critical factors such as economies of scale, demand correlation, demand distribution characteristics, and upstream and downstream costs. Specifically, we assess how these factors impact the efficacy of centralization versus decentralized inventory management in minimizing expected inventory and overall system costs. Supplemental Material: The online supplement is available at https://doi.org/10.1287/trsc.2025.0026 .
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (2) , 463-489
Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce
This paper studies a flow hub location problem (FHLP) stemming from recent trends in network design for e-commerce businesses. Specifically, e-commerce companies are flexible and agile in reoptimizing their logistics networks, including supplier (origin) and customer zone (destination) decisions. Furthermore, a large number of commodities (flows) and a relatively small sales volume for each product incentivize e-commerce retailers to lease warehouse spaces as hubs, yielding a large number of hub location candidates. As such, the proposed FHLP determines the origin and destination of each flow simultaneously with the hub location and flow routing decisions in contrast to the classical hub location problems, where the origins and destinations of all flows are predetermined. To solve this large-scale optimization problem, we propose an optimization algorithm that combines Lagrangian relaxation and Benders decomposition. Novel acceleration techniques, such as a clustering-empowered multicommodity Benders reformulation, learning-empowered elimination tests, and variable reduction techniques, are further developed to improve the performance and convergence of the algorithm. The efficiency of the proposed algorithm is evaluated via extensive computational experiments. The numerical results show that when compared with five other benchmark methods, the proposed algorithm can achieve optimal solutions faster for small-sized test instances and reduce optimality gaps for large-sized ones. For example, the proposed method achieves optimal solutions for a set of 10 test instances, with node sizes ranging from 225 to 450, within 20 minutes on average. In comparison, the automatic Benders decomposition method implemented in the commercial CPLEX solver achieves an average optimality gap of 2% within one hour. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms & Applications. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0367 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0367 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (2) , 463-489
Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce
This paper studies a flow hub location problem (FHLP) stemming from recent trends in network design for e-commerce businesses. Specifically, e-commerce companies are flexible and agile in reoptimizing their logistics networks, including supplier (origin) and customer zone (destination) decisions. Furthermore, a large number of commodities (flows) and a relatively small sales volume for each product incentivize e-commerce retailers to lease warehouse spaces as hubs, yielding a large number of hub location candidates. As such, the proposed FHLP determines the origin and destination of each flow simultaneously with the hub location and flow routing decisions in contrast to the classical hub location problems, where the origins and destinations of all flows are predetermined. To solve this large-scale optimization problem, we propose an optimization algorithm that combines Lagrangian relaxation and Benders decomposition. Novel acceleration techniques, such as a clustering-empowered multicommodity Benders reformulation, learning-empowered elimination tests, and variable reduction techniques, are further developed to improve the performance and convergence of the algorithm. The efficiency of the proposed algorithm is evaluated via extensive computational experiments. The numerical results show that when compared with five other benchmark methods, the proposed algorithm can achieve optimal solutions faster for small-sized test instances and reduce optimality gaps for large-sized ones. For example, the proposed method achieves optimal solutions for a set of 10 test instances, with node sizes ranging from 225 to 450, within 20 minutes on average. In comparison, the automatic Benders decomposition method implemented in the commercial CPLEX solver achieves an average optimality gap of 2% within one hour. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms & Applications. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0367 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0367 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- Open Access
- 3 January 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 344 (2-3) , 569-574
Digital manufacturing and supply chain: creating benefits through operations research and artificial intelligence
- 3 January 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 344 (2-3) , 569-574
Open AccessDigital manufacturing and supply chain: creating benefits through operations research and artificial intelligence
- 4 December 2024
- Published by Taylor & Francis in IISE Transactions
- Vol. 58 (1) , 16-32
To act or wait: The impact of disruption duration estimates on manufacturer’s response strategies
- 4 December 2024
- Published by Taylor & Francis in IISE Transactions
- Vol. 58 (1) , 16-32
To act or wait: The impact of disruption duration estimates on manufacturer’s response strategies
- 13 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for A Data-Driven Optimization Framework for Static Rebalancing Operations in Bike Sharing Systems
This repository provides an end-to-end solution to the static rebalancing operations in bike sharing systems. The study uses the raw data of bike demand and station inventory status to generate the optimal rebalancing routes that reallocate system-wide bike inventories among stations during the night to maintain a high service level while minimizing demand loss due to stockout or overcapacity. The repository reports the raw data, algorithms, and extensive numerical experiments reported in the paper, using real-world data from New York City Citi Bike.
- 13 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for A Data-Driven Optimization Framework for Static Rebalancing Operations in Bike Sharing Systems
This repository provides an end-to-end solution to the static rebalancing operations in bike sharing systems. The study uses the raw data of bike demand and station inventory status to generate the optimal rebalancing routes that reallocate system-wide bike inventories among stations during the night to maintain a high service level while minimizing demand loss due to stockout or overcapacity. The repository reports the raw data, algorithms, and extensive numerical experiments reported in the paper, using real-world data from New York City Citi Bike.
- 13 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
A Data-Driven Optimization Framework for Static Rebalancing Operations in Bike Sharing Systems
Bike sharing systems have been widely deployed in urban cities for first- and last-mile transportation. However, because of the geographical and temporal imbalance of bike demand, bikes need to be reallocated system-wide among stations during the night to maintain a high service level while minimizing demand loss due to stockout or overcapacity. Two technical challenges remain in optimizing the static bike rebalancing operations. One challenge is to accurately predict bike pickup and dropoff demand at each station, considering demand substitution effects and subsequently determining the optimal rebalancing quantity for each station. The other is to efficiently optimize the routing of multiple rebalancing vehicles for large-scale bike sharing systems, considering outlier stations with rebalancing quantities exceeding vehicle capacity. To this end, we propose an end-to-end solution to tackle the aforesaid challenges. Specifically, we first develop deep learning-based predictors that capture the time dependencies of station-level demand, the impact of weather conditions, and the demand substitution effect by nearby stations. Based on the demand rate, a sequential simulation-based demand loss estimator is developed to find the optimal rebalancing quantities that lead to the minimum expected demand loss. Then, a mixed integer linear programming model is formulated to optimize the routing problem of rebalancing vehicles. To address the computational challenge, we propose a data-driven decomposition algorithm to support a multivehicle multivisit rebalancing strategy by decomposing the multivehicle routing problem into smaller and tractable single-vehicle routing problems, which can be solved in parallel. Finally, extensive numerical experiments using real-world data from New York City Citi Bike demonstrate the accuracy of the proposed bike demand predictors, the impact of demand substitution, and the efficiency of the data-driven optimization framework. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This work was supported by the National Natural Science Foundation of China [Grant 72201222] and the Hong Kong Research Grants Council [Grants CityU 21500220 and CityU 11504322]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0182 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0182 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 13 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
A Data-Driven Optimization Framework for Static Rebalancing Operations in Bike Sharing Systems
Bike sharing systems have been widely deployed in urban cities for first- and last-mile transportation. However, because of the geographical and temporal imbalance of bike demand, bikes need to be reallocated system-wide among stations during the night to maintain a high service level while minimizing demand loss due to stockout or overcapacity. Two technical challenges remain in optimizing the static bike rebalancing operations. One challenge is to accurately predict bike pickup and dropoff demand at each station, considering demand substitution effects and subsequently determining the optimal rebalancing quantity for each station. The other is to efficiently optimize the routing of multiple rebalancing vehicles for large-scale bike sharing systems, considering outlier stations with rebalancing quantities exceeding vehicle capacity. To this end, we propose an end-to-end solution to tackle the aforesaid challenges. Specifically, we first develop deep learning-based predictors that capture the time dependencies of station-level demand, the impact of weather conditions, and the demand substitution effect by nearby stations. Based on the demand rate, a sequential simulation-based demand loss estimator is developed to find the optimal rebalancing quantities that lead to the minimum expected demand loss. Then, a mixed integer linear programming model is formulated to optimize the routing problem of rebalancing vehicles. To address the computational challenge, we propose a data-driven decomposition algorithm to support a multivehicle multivisit rebalancing strategy by decomposing the multivehicle routing problem into smaller and tractable single-vehicle routing problems, which can be solved in parallel. Finally, extensive numerical experiments using real-world data from New York City Citi Bike demonstrate the accuracy of the proposed bike demand predictors, the impact of demand substitution, and the efficiency of the data-driven optimization framework. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This work was supported by the National Natural Science Foundation of China [Grant 72201222] and the Hong Kong Research Grants Council [Grants CityU 21500220 and CityU 11504322]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0182 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0182 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 September 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 35 (5) , 1098-1119
A Cost-Effective Sequential Route Recommender System for Taxi Drivers
This paper develops a cost-effective sequential route recommender system to provide real-time routing recommendations for vacant taxis searching for the next passenger. We propose a prediction-and-optimization framework to recommend the searching route that maximizes the expected profit of the next successful passenger pickup based on the dynamic taxi demand-supply distribution. Specifically, this system features a deep learning-based predictor that dynamically predicts the passenger pickup probability on a road segment and a recursive searching algorithm that recommends the optimal searching route. The predictor integrates a graph convolution network (GCN) to capture the spatial distribution and a long short-term memory (LSTM) to capture the temporal dynamics of taxi demand and supply. The GCN-LSTM model can accurately predict the pickup probability on a road segment with the consideration of potential taxi oversupply. Then, the dynamic distribution of pickup probability is fed into the route optimization algorithm to recommend the optimal searching routes sequentially as route inquiries emerge in the system. The recursion tree-based route optimization algorithm can significantly reduce the computational time and provide the optimal routes within seconds for real-time implementation. Finally, extensive experiments using Beijing Taxi GPS data demonstrate the effectiveness and efficiency of the proposed recommender system. History: Accepted by Ram Ramesh, Area Editor for Data Science and Machine Learning. Funding: This work was partially supported by the Hong Kong Research Grants Council [Grants CityU 21500220, CityU 11504322] and the National Natural Science Foundation of China [Grant 72201222]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0112 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2021.0112 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 September 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 35 (5) , 1098-1119
A Cost-Effective Sequential Route Recommender System for Taxi Drivers
This paper develops a cost-effective sequential route recommender system to provide real-time routing recommendations for vacant taxis searching for the next passenger. We propose a prediction-and-optimization framework to recommend the searching route that maximizes the expected profit of the next successful passenger pickup based on the dynamic taxi demand-supply distribution. Specifically, this system features a deep learning-based predictor that dynamically predicts the passenger pickup probability on a road segment and a recursive searching algorithm that recommends the optimal searching route. The predictor integrates a graph convolution network (GCN) to capture the spatial distribution and a long short-term memory (LSTM) to capture the temporal dynamics of taxi demand and supply. The GCN-LSTM model can accurately predict the pickup probability on a road segment with the consideration of potential taxi oversupply. Then, the dynamic distribution of pickup probability is fed into the route optimization algorithm to recommend the optimal searching routes sequentially as route inquiries emerge in the system. The recursion tree-based route optimization algorithm can significantly reduce the computational time and provide the optimal routes within seconds for real-time implementation. Finally, extensive experiments using Beijing Taxi GPS data demonstrate the effectiveness and efficiency of the proposed recommender system. History: Accepted by Ram Ramesh, Area Editor for Data Science and Machine Learning. Funding: This work was partially supported by the Hong Kong Research Grants Council [Grants CityU 21500220, CityU 11504322] and the National Natural Science Foundation of China [Grant 72201222]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0112 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2021.0112 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .