Link to My Google Scholar Page.
My Erdős number is 3: Paul Erdős –> Daniel J. Kleitman –> Bruce L. Golden –> Rui Zhang
Publications
(Authors indicated with “underlined font” are Ph.D. students)
Refereed Journal Papers:
16. The Driver-Aide Problem: Coordinated Logistics for Last-Mile Delivery, with S. Raghavan, Manufacturing & Service Operations Management, 26(1):291-311, 2024.
15. The Hot Spot Coverage Patrol Problem: Formulations and Solution Approaches, with Y. Luo and B. Golden, INFORMS Journal on Computing, 35(6):1286-1307, 2023.
*The instances and source code in this paper can be downloaded here.
14. The Paired Mail Carrier Problem, with Y. Luo, B. Golden, S. Poikonen, and E. Wasil, European Journal of Operational Research, 308(2), 801-817, 2023.
13. Product-Based Approximate Linear Programs for Network Revenue Management, with S. Samiedaluie and D. Zhang, Operations Research, 70(5):2837-2850, 2022.
*The NRM instances in this paper can be downloaded here.
12. A Fresh Look at the Traveling Salesman Problem with a Center, with Y. Luo, B. Golden, and S. Poikonen, Computers & Operations Research, 143, 105748, 2022.
11. Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem, with S. Raghavan, INFORMS Journal on Computing, 34(3):1345-1365, 2022.
*The PIDS instances in this paper can be downloaded here.
10. Influence Maximization with Latency Requirements on Social Networks, with S. Raghavan, INFORMS Journal on Computing, 34(2):710-728, 2022.
*The PIDS-PP instances in this paper can be downloaded here.
9. The Weighted Target Set Selection Problem on Trees and Cycles, with S. Raghavan, Networks, 77(4):587-609, 2021.
8. A Branch-and-Cut Approach for the Least Cost Influence Problem on Social Networks, with D. Günneç and S. Raghavan, Networks, 76(1):84-105, 2020.
7. Least Cost Influence Maximization on Social Networks, with D. Günneç and S. Raghavan, INFORMS Journal on Computing, 32(2):289-302, 2020.
6. A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks, with S. Raghavan, INFORMS Journal on Optimization, 1(4):304-322, 2019.
*The WTSS instances in this paper can be downloaded here.
5. A Hybrid Heuristic Procedure for the Windy Rural Postman Problem with Time-Dependent Zigzag Service, with O. Lum, B. Golden, and E. Wasil, Computers & Operations Research, 88, 247-257, 2017.
4. The Windy Rural Postman Problem with a Time-Dependent Zigzag Option, with J. Nossack, B. Golden, and E. Pesch, European Journal of Operational Research, 258(3), 1131-1142, 2017.
3. The Min-Max Split Delivery Multi-Depot Vehicle Routing Problem with Minimum Service Time Requirement, with X. Wang, B. Golden, and E. Wasil, Computers & Operations Research, 71, 110-126, 2016.
2. Robust Optimization Model for Runway Configuration Management, with R. Kincaid, International Journal of Operations Research and Information Systems, 5(3), 1-26, 2014.
1. Rectangles Algorithm for Generating Normal Variates, with L. Leemis, Naval Research Logistics, 59(1), 52-57, 2012.
Refereed Conference Proceedings:
2. Robust Optimization Model for Runway Configuration Management, with R. Kincaid, the Proceedings of the 11th AIAA Aviation Technology, Integration, and Operations (ATIO) Conference, September 20-22, 2011, Virginia Beach, VA, AIAA.
1. Routing problems with time dependencies or how different are trash collection or newspaper delivery from street sweeping or winter gritting?, with J. Nossack, B. Golden, and E. Pesch, Procedia Engineering, 182 ( 2017 ), 235 – 240, 2016. Special issue on 7th International Conference on Engineering, Project, and Production Management, 21 – 23 September 2016, Bialystok, Poland.
Under Review/Revision:
5. Joint Dynamic Optimization of Pricing and Personalized Recommendations in Online Retailing, with Y. Lei, Z. Jiang, D. Zhang, and Y. Qi. Management Science. Under review.
4. The Driver-Aide Problem in Urban Areas, with M. Chao, A. Masone, and B. Golden. Production and Operations Management. Under review.
3. On Approximate Linear Programming for a Queueing Control Problem, with S. Samiedaluie and D. Zhang. Computers & Operations Research. Under review.
2. Branch-Cut-and-Price for the Capacitated Autonomous Vehicle Assisted Delivery Problem. INFORMS Journal on Computing. Major revision.
1. Assortment Optimization for Online Multiplayer Video Games, with F. You and T. Vossen. Production and Operations Management. Major revision.
Working Papers:
6. Probabilistic Approximations for Network Revenue Management, with S. Samiedaluie and D. Zhang.
5. The Role of Public Companies in the Polarization of American Politics, with S. Robinson , J. Rogers, N. Skinner, and L. Wellman.
4. Joint Learning and Optimization for Influence Maximization on Social Networks, with H. Zhang.
3. An Approximate Dynamic Programming Approach for Congestion-dependent Pricing of Queuing Services, with S. Samiedaluie and D. Zhang.
2. Approximate Linear Programming for Network Revenue Management: A Review and Recent Developments, with S. Samiedaluie and D. Zhang.
1. First-Order Methods for Finding Weighted Graphs with Maximum Algebraic Connectivity, with M. Lewis and D. Phillips.