M. Gisela Bardossy, Ph.D.

Research Interest

Linear Programming, Dynamic Programming, Heuristics, Telecommunication and Network Design Problems, Simulation Modeling, Agent-based Simulation.

Publications:

Journal Papers:

Copyright notice: Since most of these papers are published, the copyright has been transferred to the respective publishers. Therefore, the papers cannot be duplicated for commercial purposes. PDF links are provided solely for the purpose of timely academic dissemination.

1. An Inexact Sample Average Approximation Approach for the Stochastic Connected Facility Location Problem, with S. Raghavan, Networks, to appear.
2. Approximate Robust Optimization for the Connected Facility Location Problem, with S. Raghavan, Discrete Applied Mathematics, 210, 246-260, 2016.
3. Dual-Based Local Search for the Connected Facility Location and Related Problems, with S. Raghavan, INFORMS Journal on Computing, 22(4), 584-602, 2010.

Book Chapters:

• Communication Networks in Handbook of Discrete and Combinatorial Mathematics with David Simchi-Levi and Sunil Chopra, Chapter 10, Section 10.16, 779-793, 2017.
• Essentials of Linear Programming for Managers: From System of Inequalities to Software Implementation, with H. Arsham, and D. K. Sharma. IGI Global publisher. Chapter 7 (First Edition), 96-127, 2014.

Conference Proceedings:

• Networks Dynamics and Information Sharing: an Agent-Based Simulation Approach for the Sharing Economy with S. Za and E. Scornavacca, Proceedings of the 52nd Hawaii International Conference on System Sciences, 2019.
• Analysis of Hump Operation at a Railroad Classification Yard, 493-500, 2015
• Robust Optimization for the Connected Facility Location Problem with S. Raghavan, Electronic Notes in Discrete Mathematics, 44, 149-154, 2013.