borzou
Borzou Rostami
Polytechnique Montreal
Google Scholar
Borzou Rostami is currently a postdoctoral researcher at the Canada Excellence Research Chair in Data Science for Real-Time Decision-Making, Polytechnique Montreal. He is also a researcher at the Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT) and Group for Research in Decision Analysis (GERAD). Borzou holds a Ph.D. in Information Technology/Operations Research from the Polytechnic University of Milan, Italy. Prior to joining Polytechnique Montreal, he was a postdoctoral researcher at École de technologie supérieure, Montreal, Canada and also TU Dortmund University, Dortmund, Germany.

Publications

Journal papers

B. Rostami, N. Kammerling, C. Buchheim, Uwe Clausen, 2017. Reliable Uncapacitated Single Allocation Hub Location Problem under Hub Breakdowns. Computers & Operations Research 96, 15-29. https://doi.org/10.1016/j.cor.2018.04.002

[Elsevier]

B. Rostami, A.Chassein, M. Hopf, D. Frey, C. Buchheim, F. Malucelli,  M. Goerigk, 2017. The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods. European Journal of Operational Research 268 (2), 473-485. https://doi.org/10.1016/j.ejor.2018.01.054

[Elsevier]

B. Rostami, F. Malucelli, 2016. A Generalized Gilmore-Lawler Procedure for the Quadratic Assignment Problem. Electronic Notes in Discrete Mathematics 55, pp 77-80 .Doi.org/10.1016/j.endm.2016.10.020

[Elsevier link]

B. Rostami, C. Strothmann, C. Buchheim, 2016. A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels. Lecture Notes in Computer Science  9849, pp 237-248.  https://doi.org/10.1007/978-3-319-45587-7_21

[Springer Link]

B. Rostami, F. Malucelli, P. Belotti, S. Gualandi,  2016. Lower bounding procedure for the Asymmetric Quadratic Traveling Salesman Problem. European Journal of Operational Research 253 (3),  Pp 584-592, 2016.

[Elsevier]

B. Rostami, C. Buchheim, J.F. Meier, U. Clausen, 2016. Lower Bounding Procedures for the Single Allocation Hub Location Problem. Electronic Notes in Discrete Mathematics 52, pp 69-76. https://doi.org/10.1016/j.endm.2016.03.010

[Elsevier]

J.F. Meier, U. Clausen, B. Rostami, C. Buchheim, 2016. A Compact Linearisation of Euclidean Single Allocation Hub Location Problems. Electronic Notes in Discrete Mathematics 52, pp 37-44. https://doi.org/10.1016/j.endm.2016.03.006

[Elsevier]

B. Rostami, F. Malucelli, 2015. Lower Bounds for the Quadratic Minimum Spanning Tree Problem Based on Reduced Cost Computation. Computers & Operations Research 64, pp 178-188. https://doi.org/10.1016/j.cor.2015.06.005

[Elsevier]

B. Rostami, F. Malucelli, D. Frey, C. Buchheim, 2015. On the Quadratic Shortest Path Problem.  Lecture Notes in Computer Science 9125, pp 379-390.

[Springer Link]

B. Rostami, F. Malucelli, 2014. A Revised Reformulation-Linearization Technique for the Quadratic Assignment Problem. Discrete Optimization 14, pp 97-103. https://doi.org/10.1016/j.disopt.2014.08.003

[Elsevier link]

B. Rostami, P. Cremonesi, F. Malucelli, 2013. A Graph Optimization Approach to Item-Based Collaborative Filtering. In: Fidanova S. (eds) Recent Advances in Computational Optimization. Studies in Computational Intelligence, vol 470, Springer International Publishing, pp 15-30.

[Springer Link]

B. Rostami, F. Malucelli, P. Belotti, S. Gualandi, 2013. Quadratic TSP: A Lower Bounding Procedure and a Column Generation Approach. Federated Conference on Computer Science and Information Systems – FedCSIS, Pp 377-384.

[IEEE]

P. Cremonesi, F. Malucelli, B. Rostami, 2012. An Application of Bicriterion Shortest Paths to Collaborative Filtering. Federated Conference on Computer Science and Information Systems – FedCSIS, pp 423-429.

[IEEE]

F. Djannaty, B. Rostami, 2006. A computational Approach to Pivot Selection in the LP Relaxation of Set Problems. Journal of Applied Mathematics and Decision Sciences, pp 1-11.

[Hindawi ]

Working papers

B. Rostami, F. Errico, A. Lodi, 2018. A Convex Reformulation and an Outer Approximation for a Class of Binary Quadratic Program. DS4DM-2018-002

[Technical Report:PDF]

B. Rostami, G. Desaulniers, F. Errico, A. Lodi, 2018. The Vehicle Routing Problem with Stochastic and Correlated Travel Times. DS4DM-2018-001

[Technical Report:PDF]

B.Rostami, F. Malucelli and P. Belotti, 2017. A Tight Lower Bound for the Adjacent Quadratic Assignment Problem. eprints for the Optimization Community.

[Optimization-online]

B. Rostami, C. Buchheim, 2017. The Uncapacitated Single Allocation p-Hub Median Problem with Stepwise Cost Function. eprints for the Optimization Community.

[Optimization-online]