Borzou Rostami

Orcid: 0000-0002-2610-1622

Affiliations:
  • University of Alberta, Edmonton, Canada


According to our database1, Borzou Rostami authored at least 20 papers between 2012 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Attractiveness factors in retail category space location-allocation problem.
Int. J. Prod. Res., August, 2023

A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs.
Oper. Res., March, 2023

2022
Single Allocation Hub Location with Heterogeneous Economies of Scale.
Oper. Res., 2022

The price of anarchy in truckload transportation spot markets.
EURO J. Transp. Logist., 2022

2021
Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times.
Oper. Res., 2021

Stochastic single-allocation hub location.
Eur. J. Oper. Res., 2021

2018
The quadratic shortest path problem: complexity, approximability, and solution methods.
Eur. J. Oper. Res., 2018

Reliable single allocation hub location problem under hub breakdowns.
Comput. Oper. Res., 2018

2016
Lower bounding procedure for the asymmetric quadratic traveling salesman problem.
Eur. J. Oper. Res., 2016

A generalized Gilmore-Lawler procedure for the Quadratic Assignment Problem.
Electron. Notes Discret. Math., 2016

Lower Bounding Procedures for the Single Allocation Hub Location Problem.
Electron. Notes Discret. Math., 2016

A Compact Linearisation of Euclidean Single Allocation Hub Location Problems.
Electron. Notes Discret. Math., 2016

A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation.
Comput. Oper. Res., 2015

On the Quadratic Shortest Path Problem.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014
Decomposition methods for quadratic zero-one programming.
PhD thesis, 2014

A revised reformulation-linearization technique for the quadratic assignment problem.
Discret. Optim., 2014

2013
A Graph Optimization Approach to Item-Based Collaborative Filtering.
Proceedings of the Recent Advances in Computational Optimization, 2013

Quadratic TSP: A lower bounding procedure and a column generation approach.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012
An Application of Bicriterion Shortest Paths to Collaborative Filtering.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012


  Loading...