IDEAS home Printed from https://ideas.repec.org/e/pso177.html
   My authors  Follow this author

Renata Sotirov

Personal Details

First Name:Renata
Middle Name:
Last Name:Sotirov
Suffix:
RePEc Short-ID:pso177
http://stuwww.uvt.nl/~sotirovr/

Affiliation

CentER Graduate School for Economics and Business
School of Economics and Management
Universiteit van Tilburg

Tilburg, Netherlands
https://www.tilburguniversity.edu/research/economics-and-management/graduate-school
RePEc:edi:cekubnl (more details at EDIRC)

Research output

as
Jump to: Working papers Articles Chapters

Working papers

  1. van Dam, E.R. & Sotirov, R., 2015. "On bounding the bandwidth of graphs with symmetry," Other publications TiSEM 180849f1-e7d3-44d9-8424-5, Tilburg University, School of Economics and Management.
  2. Takano, Y. & Sotirov, R., 2010. "A Polynomial Optimization Approach to Constant Rebalanced Portfolio Selection," Discussion Paper 2010-114, Tilburg University, Center for Economic Research.
  3. Ashayeri, J. & Ma, N. & Sotirov, R., 2010. "An Aggregated Optimization Model for Multi-Head SMD Placements," Discussion Paper 2010-46, Tilburg University, Center for Economic Research.
  4. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Discussion Paper 2008-96, Tilburg University, Center for Economic Research.
  5. Rendl, F. & Sotirov, R., 2007. "Bounds for the quadratic assignment problem using the bundle method," Other publications TiSEM b6d298bc-77c9-4a6d-a043-5, Tilburg University, School of Economics and Management.
  6. Bai, Y.Q. & de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "Exploiting Group Symmetry in Truss Topology Optimization," Discussion Paper 2007-17, Tilburg University, Center for Economic Research.
  7. Anand, C. & Sotirov, R. & Terlaky, T. & Zheng, Z., 2007. "Magnetic resonance tissue density estimation using optimal SSFP pulse-sequence design," Other publications TiSEM 371b5075-1085-4bf5-bd55-4, Tilburg University, School of Economics and Management.
  8. de Klerk, E. & Sotirov, R., 2007. "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem," Discussion Paper 2007-44, Tilburg University, Center for Economic Research.
  9. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)," Discussion Paper 2007-101, Tilburg University, Center for Economic Research.
  10. de Klerk, E. & Newman, M.W. & Pasechnik, D.V. & Sotirov, R., 2006. "On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs," Discussion Paper 2006-93, Tilburg University, Center for Economic Research.
  11. Fischer, I. & Gruber, G. & Rendl, F. & Sotirov, R., 2006. "Computational experience with a bundle approach for semidenfinite cutting plane relaxations of max-cut and equipartition," Other publications TiSEM 03dfd8c3-9216-4c75-8921-3, Tilburg University, School of Economics and Management.

Articles

  1. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
  2. Frank Meijer & Renata Sotirov, 2020. "The quadratic cycle cover problem: special cases and efficient bounds," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 1096-1128, May.
  3. Hao Hu & Renata Sotirov, 2020. "On Solving the Quadratic Shortest Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 219-233, April.
  4. Fanz Rendl & Renata Sotirov, 2018. "The min-cut and vertex separator problem," Computational Optimization and Applications, Springer, vol. 69(1), pages 159-187, January.
  5. Renata Sotirov, 2018. "Graph bisection revisited," Annals of Operations Research, Springer, vol. 265(1), pages 143-154, June.
  6. Hao Hu & Renata Sotirov, 2018. "Special cases of the quadratic shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 754-777, April.
  7. Jalal Ashayeri & Ning Ma & Renata Sotirov, 2015. "Supply chain network downsizing with product line pruning using a new demand substitution," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(10), pages 1699-1716, October.
  8. Ashayeri, Jalal & Ma, Ning & Sotirov, Renata, 2015. "The redesign of a warranty distribution network with recovery processes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 184-197.
  9. Ashayeri, J. & Ma, N. & Sotirov, R., 2014. "Supply chain downsizing under bankruptcy: A robust optimization approach," International Journal of Production Economics, Elsevier, vol. 154(C), pages 1-15.
  10. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.
  11. Yuichi Takano & Renata Sotirov, 2012. "A polynomial optimization approach to constant rebalanced portfolio selection," Computational Optimization and Applications, Springer, vol. 52(3), pages 645-666, July.
  12. Maziar Salahi & Renata Sotirov & Tamás Terlaky, 2004. "On self-regular IPMs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(2), pages 209-275, December.
    RePEc:inm:orijoc:v:27:y:2015:i:2:p:378-391 is not listed on IDEAS
    RePEc:inm:orijoc:v:27:y:2015:i:1:p:75-88 is not listed on IDEAS
    RePEc:inm:orijoc:v:26:y:2014:i:1:p:16-30 is not listed on IDEAS

Chapters

  1. Renata Sotirov, 2012. "SDP Relaxations for Some Combinatorial Optimization Problems," International Series in Operations Research & Management Science, in: Miguel F. Anjos & Jean B. Lasserre (ed.), Handbook on Semidefinite, Conic and Polynomial Optimization, chapter 0, pages 795-819, Springer.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. van Dam, E.R. & Sotirov, R., 2015. "On bounding the bandwidth of graphs with symmetry," Other publications TiSEM 180849f1-e7d3-44d9-8424-5, Tilburg University, School of Economics and Management.

    Cited by:

    1. Fanz Rendl & Renata Sotirov, 2018. "The min-cut and vertex separator problem," Computational Optimization and Applications, Springer, vol. 69(1), pages 159-187, January.
    2. Janez Povh, 2021. "On the Embed and Project Algorithm for the Graph Bandwidth Problem," Mathematics, MDPI, vol. 9(17), pages 1-15, August.

  2. Ashayeri, J. & Ma, N. & Sotirov, R., 2010. "An Aggregated Optimization Model for Multi-Head SMD Placements," Discussion Paper 2010-46, Tilburg University, Center for Economic Research.

    Cited by:

    1. Cheng-Jian Lin & Chun-Hui Lin, 2021. "Using an Improved Differential Evolution for Scheduling Optimization of Dual-Gantry Multi-Head Surface-Mount Placement Machine," Mathematics, MDPI, vol. 9(16), pages 1-22, August.

  3. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Discussion Paper 2008-96, Tilburg University, Center for Economic Research.

    Cited by:

    1. Sungwoo Park & Dianne P. O’Leary, 2015. "A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 558-571, August.
    2. de Klerk, E. & Pasechnik, D.V., 2009. "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems," Discussion Paper 2009-54, Tilburg University, Center for Economic Research.
    3. Michael Orlitzky, 2021. "Gaddum’s test for symmetric cones," Journal of Global Optimization, Springer, vol. 79(4), pages 927-940, April.
    4. Klerk, Etienne de, 2010. "Exploiting special structure in semidefinite programming: A survey of theory and applications," European Journal of Operational Research, Elsevier, vol. 201(1), pages 1-10, February.
    5. Vivek Bagaria & Jian Ding & David Tse & Yihong Wu & Jiaming Xu, 2020. "Hidden Hamiltonian Cycle Recovery via Linear Programming," Operations Research, INFORMS, vol. 68(1), pages 53-70, January.
    6. de Klerk, E. & Pasechnik, D.V., 2009. "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems," Other publications TiSEM 3b5033a4-98bc-4969-aa57-d, Tilburg University, School of Economics and Management.

  4. Rendl, F. & Sotirov, R., 2007. "Bounds for the quadratic assignment problem using the bundle method," Other publications TiSEM b6d298bc-77c9-4a6d-a043-5, Tilburg University, School of Economics and Management.

    Cited by:

    1. F. Rendl, 2016. "Semidefinite relaxations for partitioning, assignment and ordering problems," Annals of Operations Research, Springer, vol. 240(1), pages 119-140, May.
    2. de Klerk, E. & Sotirov, R., 2010. "Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem," Other publications TiSEM 73287c80-3bc2-40c4-b02d-4, Tilburg University, School of Economics and Management.
    3. Dobre, C., 2011. "Semidefinite programming approaches for structured combinatorial optimization problems," Other publications TiSEM e1ec09bd-b024-4dec-acad-7, Tilburg University, School of Economics and Management.
    4. van Dam, E.R. & Sotirov, R., 2015. "On bounding the bandwidth of graphs with symmetry," Other publications TiSEM 180849f1-e7d3-44d9-8424-5, Tilburg University, School of Economics and Management.
    5. Naomi Graham & Hao Hu & Jiyoung Im & Xinxin Li & Henry Wolkowicz, 2022. "A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2125-2143, July.
    6. Jiming Peng & Tao Zhu & Hezhi Luo & Kim-Chuan Toh, 2015. "Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting," Computational Optimization and Applications, Springer, vol. 60(1), pages 171-198, January.
    7. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    8. N. Ito & S. Kim & M. Kojima & A. Takeda & K.-C. Toh, 2018. "Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems," Journal of Global Optimization, Springer, vol. 72(4), pages 619-653, December.
    9. Alexei Gaivoronski & Abdel Lisser & Rafael Lopez & Hu Xu, 2011. "Knapsack problem with probability constraints," Journal of Global Optimization, Springer, vol. 49(3), pages 397-413, March.
    10. Zhuoxuan Jiang & Xinyuan Zhao & Chao Ding, 2021. "A proximal DC approach for quadratic assignment problem," Computational Optimization and Applications, Springer, vol. 78(3), pages 825-851, April.

  5. Bai, Y.Q. & de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "Exploiting Group Symmetry in Truss Topology Optimization," Discussion Paper 2007-17, Tilburg University, Center for Economic Research.

    Cited by:

    1. Laurent, M., 2009. "Sums of squares, moment matrices and optimization over polynomials," Other publications TiSEM 9fef820b-69d2-43f2-a501-e, Tilburg University, School of Economics and Management.
    2. Miguel Carrasco & Benjamin Ivorra & Angel Manuel Ramos, 2012. "A Variance-Expected Compliance Model for Structural Optimization," Journal of Optimization Theory and Applications, Springer, vol. 152(1), pages 136-151, January.

  6. Anand, C. & Sotirov, R. & Terlaky, T. & Zheng, Z., 2007. "Magnetic resonance tissue density estimation using optimal SSFP pulse-sequence design," Other publications TiSEM 371b5075-1085-4bf5-bd55-4, Tilburg University, School of Economics and Management.

    Cited by:

    1. Rodrigo Garcés & Walter Gómez & Florian Jarre, 2011. "A self-concordance property for nonconvex semidefinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(1), pages 77-92, August.

  7. de Klerk, E. & Sotirov, R., 2007. "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem," Discussion Paper 2007-44, Tilburg University, Center for Economic Research.

    Cited by:

    1. Hu, Hao & Sotirov, Renata & Wolkowicz, Henry, 2023. "Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs," Other publications TiSEM 8dd3dbae-58fd-4238-b786-e, Tilburg University, School of Economics and Management.
    2. José F. S. Bravo Ferreira & Yuehaw Khoo & Amit Singer, 2018. "Semidefinite programming approach for the quadratic assignment problem with a sparse graph," Computational Optimization and Applications, Springer, vol. 69(3), pages 677-712, April.
    3. Samuel Burer & Sunyoung Kim & Masakazu Kojima, 2014. "Faster, but weaker, relaxations for quadratically constrained quadratic programs," Computational Optimization and Applications, Springer, vol. 59(1), pages 27-45, October.
    4. Feizollahi, Mohammad Javad & Feyzollahi, Hadi, 2015. "Robust quadratic assignment problem with budgeted uncertain flows," Operations Research Perspectives, Elsevier, vol. 2(C), pages 114-123.
    5. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)," Discussion Paper 2007-101, Tilburg University, Center for Economic Research.
    6. van Dam, E.R. & Sotirov, R., 2015. "On bounding the bandwidth of graphs with symmetry," Other publications TiSEM 180849f1-e7d3-44d9-8424-5, Tilburg University, School of Economics and Management.
    7. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Other publications TiSEM ea23cd70-a3b1-401a-aa3f-0, Tilburg University, School of Economics and Management.
    8. Laurent, M., 2009. "Sums of squares, moment matrices and optimization over polynomials," Other publications TiSEM 9fef820b-69d2-43f2-a501-e, Tilburg University, School of Economics and Management.
    9. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.
    10. Jiming Peng & Tao Zhu & Hezhi Luo & Kim-Chuan Toh, 2015. "Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting," Computational Optimization and Applications, Springer, vol. 60(1), pages 171-198, January.
    11. Brosch, Daniel & de Klerk, Etienne, 2021. "Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software," Other publications TiSEM 283da78a-b42f-47b4-b2b7-2, Tilburg University, School of Economics and Management.
    12. Matteo Fischetti & Michele Monaci & Domenico Salvagnin, 2012. "Three Ideas for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 60(4), pages 954-964, August.
    13. Fanz Rendl & Renata Sotirov, 2018. "The min-cut and vertex separator problem," Computational Optimization and Applications, Springer, vol. 69(1), pages 159-187, January.
    14. Xiaolong Kuang & Bissan Ghaddar & Joe Naoum-Sawaya & Luis F. Zuluaga, 2019. "Alternative SDP and SOCP approximations for polynomial optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 153-175, June.
    15. Nyberg, Axel & Westerlund, Tapio, 2012. "A new exact discrete linear reformulation of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 314-319.

  8. de Klerk, E. & Newman, M.W. & Pasechnik, D.V. & Sotirov, R., 2006. "On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs," Discussion Paper 2006-93, Tilburg University, Center for Economic Research.

    Cited by:

    1. Brosch, Daniel & de Klerk, Etienne, 2021. "Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software," Other publications TiSEM 283da78a-b42f-47b4-b2b7-2, Tilburg University, School of Economics and Management.

  9. Fischer, I. & Gruber, G. & Rendl, F. & Sotirov, R., 2006. "Computational experience with a bundle approach for semidenfinite cutting plane relaxations of max-cut and equipartition," Other publications TiSEM 03dfd8c3-9216-4c75-8921-3, Tilburg University, School of Economics and Management.

    Cited by:

    1. Anjos, Miguel F. & Vieira, Manuel V.C., 2017. "Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions," European Journal of Operational Research, Elsevier, vol. 261(1), pages 1-16.
    2. F. Rendl, 2016. "Semidefinite relaxations for partitioning, assignment and ordering problems," Annals of Operations Research, Springer, vol. 240(1), pages 119-140, May.
    3. Philipp Hungerländer & Franz Rendl, 2013. "A computational study and survey of methods for the single-row facility layout problem," Computational Optimization and Applications, Springer, vol. 55(1), pages 1-20, May.
    4. Timotej Hrga & Janez Povh, 2021. "MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM," Computational Optimization and Applications, Springer, vol. 80(2), pages 347-375, November.
    5. Alain Billionnet & Sourour Elloumi & Amélie Lambert & Angelika Wiegele, 2017. "Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 318-331, May.
    6. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    7. Cheng Lu & Zhibin Deng, 2021. "A branch-and-bound algorithm for solving max-k-cut problem," Journal of Global Optimization, Springer, vol. 81(2), pages 367-389, October.
    8. Janez Povh, 2021. "On the Embed and Project Algorithm for the Graph Bandwidth Problem," Mathematics, MDPI, vol. 9(17), pages 1-15, August.
    9. Alexander Engau & Miguel Anjos & Immanuel Bomze, 2013. "Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(1), pages 35-59, August.

Articles

  1. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.

    Cited by:

    1. Fei Chen & Zhiyang Wang & Yu He, 2023. "A Deep Neural Network-Based Optimal Scheduling Decision-Making Method for Microgrids," Energies, MDPI, vol. 16(22), pages 1-17, November.

  2. Frank Meijer & Renata Sotirov, 2020. "The quadratic cycle cover problem: special cases and efficient bounds," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 1096-1128, May.

    Cited by:

    1. Frank de Meijer & Renata Sotirov, 2021. "SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1262-1276, October.
    2. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.

  3. Hao Hu & Renata Sotirov, 2020. "On Solving the Quadratic Shortest Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 219-233, April.

    Cited by:

    1. Hu, Hao & Sotirov, Renata & Wolkowicz, Henry, 2023. "Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs," Other publications TiSEM 8dd3dbae-58fd-4238-b786-e, Tilburg University, School of Economics and Management.
    2. Frank de Meijer & Renata Sotirov, 2021. "SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1262-1276, October.
    3. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.

  4. Fanz Rendl & Renata Sotirov, 2018. "The min-cut and vertex separator problem," Computational Optimization and Applications, Springer, vol. 69(1), pages 159-187, January.

    Cited by:

    1. Hu, Hao & Sotirov, Renata & Wolkowicz, Henry, 2023. "Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs," Other publications TiSEM 8dd3dbae-58fd-4238-b786-e, Tilburg University, School of Economics and Management.
    2. Norberto Castillo-García & Paula Hernández Hernández, 2019. "Two new integer linear programming formulations for the vertex bisection problem," Computational Optimization and Applications, Springer, vol. 74(3), pages 895-918, December.
    3. Kuryatnikova, Olga & Sotirov, Renata & Vera, J.C., 2022. "The maximum $k$-colorable subgraph problem and related problems," Other publications TiSEM 40e477c0-a78e-4ee1-92de-8, Tilburg University, School of Economics and Management.
    4. Olga Kuryatnikova & Renata Sotirov & Juan C. Vera, 2022. "The Maximum k -Colorable Subgraph Problem and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 656-669, January.
    5. Xinxin Li & Ting Kei Pong & Hao Sun & Henry Wolkowicz, 2021. "A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem," Computational Optimization and Applications, Springer, vol. 78(3), pages 853-891, April.

  5. Renata Sotirov, 2018. "Graph bisection revisited," Annals of Operations Research, Springer, vol. 265(1), pages 143-154, June.

    Cited by:

    1. Hu, Hao & Sotirov, Renata & Wolkowicz, Henry, 2023. "Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs," Other publications TiSEM 8dd3dbae-58fd-4238-b786-e, Tilburg University, School of Economics and Management.

  6. Hao Hu & Renata Sotirov, 2018. "Special cases of the quadratic shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 754-777, April.

    Cited by:

    1. Christoph Buchheim & Emiliano Traversi, 2018. "Quadratic Combinatorial Optimization Using Separable Underestimators," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 424-437, August.
    2. Frank Meijer & Renata Sotirov, 2020. "The quadratic cycle cover problem: special cases and efficient bounds," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 1096-1128, May.
    3. Brad D. Woods & Abraham P. Punnen, 2020. "A class of exponential neighbourhoods for the quadratic travelling salesman problem," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 303-332, August.
    4. Zhang, Yufeng & Khani, Alireza, 2019. "An algorithm for reliable shortest path problem with travel time correlations," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 92-113.
    5. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
    6. Brad D. Woods & Abraham P. Punnen, 0. "A class of exponential neighbourhoods for the quadratic travelling salesman problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-30.

  7. Jalal Ashayeri & Ning Ma & Renata Sotirov, 2015. "Supply chain network downsizing with product line pruning using a new demand substitution," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(10), pages 1699-1716, October.

    Cited by:

    1. Zhu, Qingyun & Shah, Purvi & Sarkis, Joseph, 2018. "Addition by subtraction: Integrating product deletion with lean and sustainable supply chain management," International Journal of Production Economics, Elsevier, vol. 205(C), pages 201-214.
    2. Jahani, Hamed & Abbasi, Babak & Sheu, Jiuh-Biing & Klibi, Walid, 2024. "Supply chain network design with financial considerations: A comprehensive review," European Journal of Operational Research, Elsevier, vol. 312(3), pages 799-839.

  8. Ashayeri, Jalal & Ma, Ning & Sotirov, Renata, 2015. "The redesign of a warranty distribution network with recovery processes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 184-197.

    Cited by:

    1. Yazdekhasti, Amin & sharifzadeh, Shila & Ma, Junfeng, 2022. "A two-echelon two-indenture warranty distribution network development and optimization under batch-ordering inventory policy," International Journal of Production Economics, Elsevier, vol. 249(C).
    2. Zhang, Abraham & Wang, Jason X. & Farooque, Muhammad & Wang, Yulan & Choi, Tsan-Ming, 2021. "Multi-dimensional circular supply chain management: A comparative review of the state-of-the-art practices and research," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    3. Lin, Yizhong & Leung, Janny M.Y. & Zhang, Lianmin & Gu, Jia-Wen, 2020. "Single-item repairable inventory system with stochastic new and warranty demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    4. Amin Yazdekhasti & Yahia Zare Mehrjardi, 2020. "Two-echelon three-indenture warranty distribution network: a hybrid branch and bound, Monte-Carlo approach," Operational Research, Springer, vol. 20(2), pages 1113-1158, June.
    5. Cannella, Salvatore & Bruccoleri, Manfredi & Framinan, Jose M., 2016. "Closed-loop supply chains: What reverse logistics factors influence performance?," International Journal of Production Economics, Elsevier, vol. 175(C), pages 35-49.
    6. Luttiely Santos Oliveira & Ricardo Luiz Machado, 2021. "Application of optimization methods in the closed-loop supply chain: a literature review," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 357-400, February.

  9. Ashayeri, J. & Ma, N. & Sotirov, R., 2014. "Supply chain downsizing under bankruptcy: A robust optimization approach," International Journal of Production Economics, Elsevier, vol. 154(C), pages 1-15.

    Cited by:

    1. Surya Prakash & Sameer Kumar & Gunjan Soni & Vipul Jain & Ajay Pal Singh Rathore, 2020. "Closed-loop supply chain network design and modelling under risks and demand uncertainty: an integrated robust optimization approach," Annals of Operations Research, Springer, vol. 290(1), pages 837-864, July.
    2. Barbosa-Póvoa, Ana Paula & da Silva, Cátia & Carvalho, Ana, 2018. "Opportunities and challenges in sustainable supply chain: An operations research perspective," European Journal of Operational Research, Elsevier, vol. 268(2), pages 399-431.
    3. Hou, Yunzhang & Wang, Xiaoling & Wu, Yenchun Jim & He, Peixu, 2018. "How does the trust affect the topology of supply chain network and its resilience? An agent-based approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 229-241.
    4. Jahani, Hamed & Abbasi, Babak & Sheu, Jiuh-Biing & Klibi, Walid, 2024. "Supply chain network design with financial considerations: A comprehensive review," European Journal of Operational Research, Elsevier, vol. 312(3), pages 799-839.
    5. Viktoryia Buhayenko & Dick den Hertog, 2017. "Adjustable Robust Optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 55(22), pages 6801-6823, November.

  10. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.

    Cited by:

    1. Feizollahi, Mohammad Javad & Feyzollahi, Hadi, 2015. "Robust quadratic assignment problem with budgeted uncertain flows," Operations Research Perspectives, Elsevier, vol. 2(C), pages 114-123.

  11. Maziar Salahi & Renata Sotirov & Tamás Terlaky, 2004. "On self-regular IPMs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(2), pages 209-275, December.

    Cited by:

    1. Salahi, Maziar & Terlaky, Tamas, 2007. "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, Elsevier, vol. 182(2), pages 502-513, October.

Chapters

  1. Renata Sotirov, 2012. "SDP Relaxations for Some Combinatorial Optimization Problems," International Series in Operations Research & Management Science, in: Miguel F. Anjos & Jean B. Lasserre (ed.), Handbook on Semidefinite, Conic and Polynomial Optimization, chapter 0, pages 795-819, Springer.

    Cited by:

    1. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Renata Sotirov should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.