IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v4y2023i1d10.1007_s43069-022-00187-z.html
   My bibliography  Save this article

In memory of Professor Nenad Mladenović (1951–2022)

Author

Listed:
  • Angelo Sifaleras

    (University of Macedonia)

Abstract

This article is dedicated to the memory of Professor Nenad Mladenović. It provides a short biography, a description of his main scientific achievements, and also testimonials from scholars all over the world who were collaborators for several years. This peer recognition highlights not only his exceptional academic career but also the integrity of his character.

Suggested Citation

  • Angelo Sifaleras, 2023. "In memory of Professor Nenad Mladenović (1951–2022)," SN Operations Research Forum, Springer, vol. 4(1), pages 1-18, March.
    • Handle: RePEc:spr:snopef:v:4:y:2023:i:1:d:10.1007_s43069-022-00187-z
    DOI: 10.1007/s43069-022-00187-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-022-00187-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-022-00187-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sifaleras, Angelo & Konstantaras, Ioannis & Mladenović, Nenad, 2015. "Variable neighborhood search for the economic lot sizing problem with product returns and recovery," International Journal of Production Economics, Elsevier, vol. 160(C), pages 133-143.
    2. Abraham Duarte & Juan Pantrigo & Eduardo Pardo & Nenad Mladenovic, 2015. "Multi-objective variable neighborhood search: an application to combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 63(3), pages 515-536, November.
    3. Ilic, Aleksandar & Urosevic, Dragan & Brimberg, Jack & Mladenovic, Nenad, 2010. "A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 206(2), pages 289-300, October.
    4. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    5. Nenad Mladenović & Zvi Drezner & Jack Brimberg & Dragan Urošević, 2022. "Less Is More Approach in Heuristic Optimization," Springer Books, in: Saïd Salhi & John Boylan (ed.), The Palgrave Handbook of Operations Research, chapter 0, pages 469-499, Springer.
    6. Jun Pei & Zorica Dražić & Milan Dražić & Nenad Mladenović & Panos M. Pardalos, 2019. "Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 235-250, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Abraham Duarte & Eduardo G. Pardo, 2020. "Special issue on recent innovations in variable neighborhood search," Journal of Heuristics, Springer, vol. 26(3), pages 335-338, June.
    2. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
    3. Yıldız, Gazi Bilal & Soylu, Banu, 2019. "A multiobjective post-sales guarantee and repair services network design problem," International Journal of Production Economics, Elsevier, vol. 216(C), pages 305-320.
    4. Iliopoulou, Christina & Makridis, Michail A., 2023. "Critical multi-link disruption identification for public transport networks: A multi-objective optimization framework," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    5. Soylu, Banu & Katip, Hatice, 2019. "A multiobjective hub-airport location problem for an airline network design," European Journal of Operational Research, Elsevier, vol. 277(2), pages 412-425.
    6. Nevena Čolić & Pavle Milošević & Ivana Dragović & Miljan S. Ćeranić, 2024. "IBA-VNS: A Logic-Based Machine Learning Algorithm and Its Application in Surgery," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    7. Todosijević, Raca & Benmansour, Rachid & Hanafi, Saïd & Mladenović, Nenad & Artiba, Abdelhakim, 2016. "Nested general variable neighborhood search for the periodic maintenance problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 385-396.
    8. Sergio Gil-Borrás & Eduardo G. Pardo & Antonio Alonso-Ayuso & Abraham Duarte, 2020. "GRASP with Variable Neighborhood Descent for the online order batching problem," Journal of Global Optimization, Springer, vol. 78(2), pages 295-325, October.
    9. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    10. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    11. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2018. "Minimizing Piecewise-Concave Functions Over Polyhedra," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 580-597, May.
    12. Timo Hilger & Florian Sahling & Horst Tempelmeier, 2016. "Capacitated dynamic production and remanufacturing planning under demand and return uncertainty," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 849-876, October.
    13. Kilic, Onur A. & Tunc, Huseyin & Tarim, S. Armagan, 2018. "Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1102-1109.
    14. Fernandez del Pozo, J. A. & Bielza, C. & Gomez, M., 2005. "A list-based compact representation for large decision tables management," European Journal of Operational Research, Elsevier, vol. 160(3), pages 638-662, February.
    15. Amina Lamghari & Roussos Dimitrakopoulos & Jacques Ferland, 2015. "A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines," Journal of Global Optimization, Springer, vol. 63(3), pages 555-582, November.
    16. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    17. Patricia Domínguez-Marín & Stefan Nickel & Pierre Hansen & Nenad Mladenović, 2005. "Heuristic Procedures for Solving the Discrete Ordered Median Problem," Annals of Operations Research, Springer, vol. 136(1), pages 145-173, April.
    18. Ali Shahabi & Sadigh Raissi & Kaveh Khalili-Damghani & Meysam Rafei, 2021. "Designing a resilient skip-stop schedule in rapid rail transit using a simulation-based optimization methodology," Operational Research, Springer, vol. 21(3), pages 1691-1721, September.
    19. Janssens, Jochen & Talarico, Luca & Sörensen, Kenneth, 2016. "A hybridised variable neighbourhood tabu search heuristic to increase security in a utility network," Reliability Engineering and System Safety, Elsevier, vol. 145(C), pages 221-230.
    20. Wilson, Duncan T. & Hawe, Glenn I. & Coates, Graham & Crouch, Roger S., 2013. "A multi-objective combinatorial model of casualty processing in major incident response," European Journal of Operational Research, Elsevier, vol. 230(3), pages 643-655.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:snopef:v:4:y:2023:i:1:d:10.1007_s43069-022-00187-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may 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.