Sprungmarken

Servicenavigation

Fakultät für Mathematik

Hauptnavigation



Sie sind hier:

Bereichsnavigation



Hauptinhalt

Dr. Borzou Rostami

Kontakt

Technische Universität Dortmund
Fakultät für Mathematik
Vogelpothsweg 87
44227 Dortmund
Germany

Email: Borzou Rostami

Telefon: (0231) 755-7226
Raum: M/520

Sprechstunde

  • nach Vereinbarung (E-Mail genügt)

Interessengebiete

  • Mixed Integer Nonlinear Programming
  • Quadratic 0-1 Programming
  • Combinatorial Optimization

Projekte

Veröffentlichungen

  • A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels
    International Symposium on Combinatorial Optimization – ISCO 2016, LNCS (2016), to appear
    (with C. Strothmann and C. Buchheim)
  • Lower bounding procedure for the Asymmetric Quadratic Traveling Salesman Problem
    European journal of Operational Research 253, Pp 584–592 (2016)
    (with F. Malucelli, P. Belotti, and S. Gualandi)
  • Lower Bounding Procedures for the Single Allocation Hub Location Problem
    International Network Optimization Conference – INOC 2015, Electronic Notes in Discrete Mathematics 52, Pp 69–76 (2016)
    (with C. Buchheim, J.F. Meier, and U. Clausen)
  • A Compact Linearisation of Euclidean Single Allocation Hub Location Problems
    International Network Optimization Conference – INOC 2015, Electronic Notes in Discrete Mathematics 52, Pp 37–44 (2016)
    (with C. Buchheim, J.F. Meier, and U. Clausen)
  • Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation
    Computers & Operations Research 64, Pp 178–188 (2015)
    (with F. Malucelli)
  • On the Quadratic Shortest Path Problem
    14th International Symposium on Experimental Algorithms – SEA 2015, LNCS 9125, Pp 379–390 (2015)
    (with F. Malucelli, D. Frey, and C. Buchheim)
  • A revised reformulation-linearization technique for the quadratic assignment problem
    Discrete Optimization 14, Pp 97–103 (2014)
    (with F. Malucelli)
  • Improved Lower Bound for the Quadratic Minimum Spanning Tree Problem
    3rd International Symposium on Combinatorial Optimization (2014)
    (with F. Malucelli)
  • Quadratic TSP: A lower bounding procedure and a column generation approach
    FedCSIS 2013, Pp 377–384
    (with F. Malucelli, P. Belotti, and S. Gualandi)
  • A Graph Optimization Approach to Item-Based Collaborative Filtering
    Recent Advances in Computational Optimization, Springer International Publishing, Pp 15–30 (2013)
    (with P. Cremonesi and F. Malucelli)
  • An Application of Bicriterion Shortest Paths to Collaborative Filtering
    FedCSIS 2012, Pp 423–429
    (with F. Malucelli and P. Cremonesi)
  • A New Variant of Two-Phase Simplex Algorithm
    23th International Conference of The Gangeon Mathematical Society, Iran (2010)
    (with F. Noorzadeh)
  • An Improving Variant of Karmarkar’s Interior Point Algorithm
    Proceedings of 4th Iranian Conference On Applied Mathematics (2010)
    (with F. Noorzadeh)
  • A computational approach to pivot selection in the LP relaxation of set problems
    Advances in Decision Sciences 2006 (2006)
    (with F. Djannaty)

Preprints

  • The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods
    Optimization Online (2016)
    (with A. Chassein, M. Hopf, D. Frey, C. Buchheim, F. Malucelli, and M. Goerigk)
  • Solving Single Allocation Hub Location Problems with Stepwise Cost Function
    Optimization Online (2015)
    (with J.F. Meier, C. Buchheim, and U. Clausen)
  • A tight lower bound for the Adjacent Quadratic Assignment Problem
    Optimization Online (2014)
    (with F. Malucelli and P. Belotti)