1. Fazekas, K., Sinnl, M., Biere, A., Parragh, S. (2020) Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem. Accepted at CPAIOR 2020.
  2. Nazemi N., Parragh S., Gutjahr W. (2020) Bi-objective facility location in the presence of uncertainty. Proceedings of the TSL Second Triennial Conference.
  3. Feillet, D., Parragh, S.N., Tricoire, F. (2019) A Local-Search Based Heuristic for the Unrestricted Block Relocation Problem. Computers and Operations Research, 108, 44-56., Preprint:
  4. Parragh, S.N., Tricoire F. (2019). Branch-and-bound for bi-objective integer programming. INFORMS Journal on Computing, 31(4), 805-822.
  5. Parragh, S.N., Tricoire, F. (2019). Das Potential der Mehrzieloptimierung in der Logistik. In F.P. Starkl, M. Prandtstetter, T. Wakolbinger, G. Reiner: Jahrbuch der Logistikforschung, Vol 2, Trauner Verlag.
  6. Parragh, S.N., Doerner, K.F. (2018). Solving Routing Problems with pairwise synchronization constraints. Central European Journal of Operational Research.
  7. Tricoire, F., Parragh, S.N. (2017). Investing in logistics facilities today to reduce routing emissions tomorrow. Transportation Research B 103, 56-67.
  8. Parragh, S.N., Cordeau J.-F. (2017). Branch-and-Price and Adaptive Large Neighborhood Search for the Truck and Trailer Routing Problem with Time Windows. Computers and Operations Research 83, 28-44.
  9. Ehrgott, M., Ljubic, I., Parragh, S.N. (2017). Feature Cluster: Recent Advances in Exact Methods for Multi-Objective Optimisation. European Journal of Operational Research 260(3),  805-806.
  10. Enzi, M., Biesinger, B., Knopp, S., Parragh, S. N., Prandtstetter, M. (2017). Planning Shared Corporate Mobility Services. Transportation Research Procedia, 27, 270-277.
  11. Tricoire, F., Parragh, S.N., Gansterer, M. (2016). The Golf Tourist Problem. In “Dynamic Perspectives on Managerial Decision Making: Essays in Honor of Richard F. Hartl”, Dawid, H., Doerner, K.F., Feichtinger, G., Kort, P.M., Seidl, A. (eds), Volume 22 of the series Dynamic Modeling and Econometrics in Economics and Finance, Springer International Publishing, pages 473-489.
  12. Braekers, K., Hartl, R.F., Parragh, S.N., Tricoire, F. (2016). A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience.  European Journal of Operational Research 248(2), 428–443.
  13. Kovacs, A.A., Golden, B., Hartl, R.F., Parragh, S.N. (2015). The generalized consistent vehicle routing problem. Transportation Science 49(4), 796-816.
  14. Kovacs, A.A., Parragh, S.N., Hartl, R.F. (2015) The Multi-Objective Generalized Consistent Vehicle Routing Problem. European Journal of Operational Research 247(2), 441-458.
  15. Parragh, S.N., Pinho de Sousa, J., Almada-Lobo, B. (2015). The dial-a-ride problem with split requests and profits, Transportation Science, 49(2), 311-334.
  16. Boegl, M., Doerner, K.F., Parragh, S.N. (2015). The school bus routing and scheduling problem with transfers. Networks, 65(2), 180-203.
  17. Kovacs, A.A., Hartl, R.F., Parragh, S.N., Golden, B. (2014). Vehicle routing problems in which consistency considerations are important: A survey. Networks, 64(3) ,192-213.
  18. Kovacs, A. A., Parragh, S. N., Hartl, R. F. (2014). A template based adaptive large neighborhood search for the consistent vehicle routing problem. Networks, 63(1), 60-81.
  19. Amorim, P., Parragh, S. N., Sperandio, F., Almada-Lobo, B. (2014). A rich vehicle routing problem dealing with perishable food: a case study. Top, 22(2), 489-508.
  20. Lehuédé, F., Masson, R., Parragh, S.N., Péton, O., Tricoire, F. (2014). A multi-criteria large neighborhood search for the transportation of disabled people. Journal of the Operational Research Society 65, 983–1000.
  21. Parragh, S.N. and Schmid, V. (2013). Hybrid column generation and large neighborhood search for the dial-a-ride problem. Computers & Operations Research 40 (1), 490–497.
  22. Kovacs, A.A., Parragh, S.N., Doerner, K.F., Hartl, R.F. (2012). Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of Scheduling 15 (5), 579–600.
  23. Parragh, S.N, Cordeau, J.-F., Doerner, K.F., Hartl, R.F. (2012). Models and Algorithms for the Heterogeneous Dial-a-Ride Problem with Driver Related Constraints. OR Spectrum, 34(3), 593-633.
  24. Parragh, S.N. (2011). Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transportation Research Part C, 19 (5), 912-930.
  25. Parragh, S.N., Doerner, K.F., Hartl, R.F. (2010). Variable Neighborhood Search for the Dial-a-Ride Problem. Computers & Operations Research, 37(6), 1129–1138.
  26. Parragh, S.N., Doerner, K.F., Hartl, R.F. (2010). Demand responsive transportation. in: Wiley Encyclopedia of Operations Research and Management Science, James J. Cochran (ed.).
  27. Parragh, S.N., Doerner, K.F., Gandibleux, X., Hartl, R.F. (2009). A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks, 54, 227 – 242.
  28. Parragh, S.N., Doerner, K.F., Hartl, R.F. (2008). A survey on pickup and delivery problems. Part I: Transportation between customers and depot. Journal für Betriebswirtschaft, 58(1), 21-51.
  29. Parragh, S.N., Doerner, K.F., Hartl, R.F. (2008). A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft, 58(2), 81–117.

Technical reports submitted for publication

    1. Parragh, S.N., Tricoire, T., Gutjahr, W. (2020) A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
    2. Enzi, M., Parragh, S. N., & Pisinger, D. (2020). Modeling and solving a vehicle-sharing problem.
    3. Turkeš, R., Sörensen, K., Hvattum, L.M., Barrena, E., Chentli, H., Coelho, L., Dayarian, I., Grimault, A., Gullhav, A., Iris, Ç., Keskin, M., Kiefer, A., Lusby, R., Mauri, G., Monroy-Licht, M., Parragh, S.N., Riquelme-Rodríguez, J.-P., Santini, A., Gandra Martins Santos, V., Thomas, C. (2019). Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search
    4. Enzi, M., Parragh, S.N., Pisinger, D., Prandtstetter, M. (2018). Modeling and solving the multimodal car- and ride-sharing problem.
    5. Hauder, V.A., Beham, A., Raggl, S., Parragh, S.N., Affenzeller, M. (2018). On constraint programming for a new flexible project scheduling problem with resource constraints.

Technical reports

  1. Parragh, S.N., Cordeau, J.-F. (2015). Branch-and-price for the truck and trailer routing problem with time windows. CIRRELT report 2015-54.
  2. Parragh, S.N., Pinho de Sousa, J., Almada-Lobo, B. (2012). Valid inequalities for the dial-a-ride problem with split requests and profits. Technical report, IBM Center for Advanced Studies/INESC Porto and University of Vienna.