default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBorzou Rostami
Person information
- affiliation: University of Alberta, Edmonton, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Sara Babaee, Mojtaba Araghi
, Ignacio Castillo, Borzou Rostami:
Attractiveness factors in retail category space location-allocation problem. Int. J. Prod. Res. 61(16): 5566-5584 (2023)- [j13]Borzou Rostami, Fausto Errico, Andrea Lodi:
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs. Oper. Res. 71(2): 471-486 (2023) - 2022
- [j12]Michael A. Haughton, Borzou Rostami, Shervin Espahbod:
The price of anarchy in truckload transportation spot markets. EURO J. Transp. Logist. 11: 100071 (2022) - [j11]Borzou Rostami, Masoud Chitsaz, Okan Arslan, Gilbert Laporte, Andrea Lodi:
Single Allocation Hub Location with Heterogeneous Economies of Scale. Oper. Res. 70(2): 766-785 (2022) - 2021
- [j10]Borzou Rostami, Nicolas Kämmerling, Joe Naoum-Sawaya, Christoph Buchheim, Uwe Clausen:
Stochastic single-allocation hub location. Eur. J. Oper. Res. 289(3): 1087-1106 (2021) - [j9]Borzou Rostami, Guy Desaulniers, Fausto Errico, Andrea Lodi:
Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times. Oper. Res. 69(2): 436-455 (2021)
2010 – 2019
- 2018
- [j8]Borzou Rostami, Nicolas Kämmerling, Christoph Buchheim, Uwe Clausen:
Reliable single allocation hub location problem under hub breakdowns. Comput. Oper. Res. 96: 15-29 (2018) - [j7]Borzou Rostami, André B. Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk:
The quadratic shortest path problem: complexity, approximability, and solution methods. Eur. J. Oper. Res. 268(2): 473-485 (2018) - 2016
- [j6]J. Fabian Meier, Uwe Clausen, Borzou Rostami, Christoph Buchheim:
A Compact Linearisation of Euclidean Single Allocation Hub Location Problems. Electron. Notes Discret. Math. 52: 37-44 (2016) - [j5]Borzou Rostami, Christoph Buchheim, J. Fabian Meier, Uwe Clausen:
Lower Bounding Procedures for the Single Allocation Hub Location Problem. Electron. Notes Discret. Math. 52: 69-76 (2016) - [j4]Borzou Rostami, Federico Malucelli:
A generalized Gilmore-Lawler procedure for the Quadratic Assignment Problem. Electron. Notes Discret. Math. 55: 77-80 (2016) - [j3]Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi:
Lower bounding procedure for the asymmetric quadratic traveling salesman problem. Eur. J. Oper. Res. 253(3): 584-592 (2016) - [c4]Borzou Rostami, Christopher Strothmann, Christoph Buchheim:
A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels. ISCO 2016: 237-248 - 2015
- [j2]Borzou Rostami, Federico Malucelli:
Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation. Comput. Oper. Res. 64: 178-188 (2015) - [c3]Borzou Rostami, Federico Malucelli, Davide Frey, Christoph Buchheim:
On the Quadratic Shortest Path Problem. SEA 2015: 379-390 - 2014
- [b1]Borzou Rostami:
Decomposition methods for quadratic zero-one programming. Polytechnic University of Milan, Italy, 2014 - [j1]Borzou Rostami, Federico Malucelli:
A revised reformulation-linearization technique for the quadratic assignment problem. Discret. Optim. 14: 97-103 (2014) - 2013
- [c2]Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi:
Quadratic TSP: A lower bounding procedure and a column generation approach. FedCSIS 2013: 377-384 - [p1]Borzou Rostami, Paolo Cremonesi, Federico Malucelli:
A Graph Optimization Approach to Item-Based Collaborative Filtering. Recent Advances in Computational Optimization 2013: 15-30 - 2012
- [c1]Federico Malucelli, Paolo Cremonesi, Borzou Rostami:
An Application of Bicriterion Shortest Paths to Collaborative Filtering. FedCSIS 2012: 423-429
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
