{"id":4634,"date":"2022-10-26T16:35:19","date_gmt":"2022-10-26T14:35:19","guid":{"rendered":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/acmes-2\/mahdi-moeini\/"},"modified":"2022-10-26T16:35:19","modified_gmt":"2022-10-26T14:35:19","slug":"mahdi-moeini","status":"publish","type":"page","link":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/acmes-2\/mahdi-moeini\/","title":{"rendered":"Mahdi MOEINI"},"content":{"rendered":"<p><div class=\"bandeau-personnel MonLaboUser\"><img decoding=\"async\" src=\"https:\/\/samovar.telecom-sudparis.eu\/wp-content\/uploads\/2022\/10\/Mahdi-MOEINI-150x150.jpg\" class=\"wp-image-6 alignleft img-arrondi wp-post-image\" height=\"150\" width=\"150\" alt=\" \" \/><div class=\"adresse\"><p>SAMOVAR - SAMOVAR<br \/>Telecom SudParis<br \/>\r\n9 rue Charles Fourier<br \/>\r\n91011 EVRY CEDEX<\/p><p>Fax : +33 (0) 1 60 76 20 80<\/p><\/div><div class=\"monlaboBlocTexte\"><h1>Mahdi <span class=\"MonLabo-lastname\">MOEINI<\/span><\/h1><div class=\"coordonnees\"><em>Ma\u00eetre de Conf\u00e9rences<\/em><br \/><span class=\"team-description\"><a href=\"https:\/\/samovar.telecom-sudparis.eu\/?page_id=4729\" class=\"MonLaboLink\"><span class=\"MonLabo_team_name\">SOP<\/span><\/a><\/span><\/div><div class=\"coordonnees\"><span class=\"MonLabo-email\">mahdi.moeini[&#64;<span>-Code to remove to avoid SPAM-<\/span>]ensiie.fr<\/span><\/div><div class=\"external_url\"><h1 style=\"text-align: center;\"><a href=\"https:\/\/sites.google.com\/view\/mahdi-moeini\"><button class=\"btn btn-oldstyle\" type=\"button\">Site personnel<\/button><\/a><\/h1><\/div><\/div><\/div>\n<div id=\"res_script\">\n<p class='Rubrique'>Article dans une revue<\/p>\n<p class='SousRubrique'>2023<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Konstantin Kloster, Mahdi Moeini, Daniele Vigo, Oliver Wendt. The multiple traveling salesman problem in presence of drone- and robot-supported packet stations. <i>European Journal of Operational Research<\/i>, 2023, 305 (2), pp.630-643. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ejor.2022.06.004\">&#x27E8;10.1016\/j.ejor.2022.06.004&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848405v1\">&#x27E8;hal-03848405&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848405v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2020<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Daniel Schermer, Mahdi Moeini, Oliver Wendt. A branch\u2010and\u2010cut approach and alternative formulations for the traveling salesman problem with drone. <i>Networks<\/i>, 2020, 76 (2), pp.164-186. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/net.21958\">&#x27E8;10.1002\/net.21958&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848440v1\">&#x27E8;hal-03848440&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848440v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2019<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Daniel Schermer, Mahdi Moeini, Oliver Wendt. A matheuristic for the vehicle routing problem with drones and its variants. <i>Transportation research. Part C, Emerging technologies<\/i>, 2019, 106, pp.166-204. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.trc.2019.06.016\">&#x27E8;10.1016\/j.trc.2019.06.016&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848456v1\">&#x27E8;hal-03848456&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848456v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2017<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokem\u00fcller, Alexander Kr\u00f6ller, et al.. Algorithms for art gallery illumination. <i>Journal of Global Optimization<\/i>, 2017, 68 (1), pp.23-45. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10898-016-0452-2\">&#x27E8;10.1007\/s10898-016-0452-2&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848588v1\">&#x27E8;hal-03848588&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/arxiv.org\/pdf\/1410.5952\"  target=\"_blank\"><img decoding=\"async\" alt=\"https:\/\/arxiv.org\/pdf\/1410.5952\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/arxiv.gif\" border=\"0\" title=\"arXiv PDF\" width=\"16px\" height=\"16px\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03848588v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Dominik Goeke, Mahdi Moeini, David Poganiuch. A Variable Neighborhood Search heuristic for the maximum ratio clique problem. <i>Computers and Operations Research<\/i>, 2017, 87, pp.283-291. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.cor.2017.01.010\">&#x27E8;10.1016\/j.cor.2017.01.010&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848589v1\">&#x27E8;hal-03848589&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848589v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2016<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Balal Karimi, Esmaile Khorram, Mahdi Moeini. Identification of congestion by means of integer-valued data envelopment analysis. <i>Computers & Industrial Engineering<\/i>, 2016, 98, pp.513-521. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.cie.2016.06.017\">&#x27E8;10.1016\/j.cie.2016.06.017&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848570v1\">&#x27E8;hal-03848570&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848570v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2015<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Zied Jemai, Evren Sahin. Location and relocation problems in the context of the emergency medical service systems: a case study. <i>Central European Journal of Operations Research<\/i>, 2015, 23 (3), pp.641-658. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10100-014-0374-3\">&#x27E8;10.1007\/s10100-014-0374-3&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848523v1\">&#x27E8;hal-03848523&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848523v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Zied Jemai, Evren Sahin. Location and relocation problems in the context of the emergency medical service systems: a case study. <i>Central European Journal of Operations Research<\/i>, 2015, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10100-014-0374-3\">&#x27E8;10.1007\/s10100-014-0374-3&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01265042v1\">&#x27E8;hal-01265042&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01265042v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2014<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Hoai An Le Thi, Mahdi Moeini. Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm. <i>Journal of Optimization Theory and Applications<\/i>, 2014, 161 (1), pp.199 - 224. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10957-012-0197-0\">&#x27E8;10.1007\/s10957-012-0197-0&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636672v1\">&#x27E8;hal-01636672&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636672v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2012<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Hoai An Le Thi, Mahdi Moeini, Tao Pham Dinh, Joaquim Judice. A DC programming approach for solving the\u00a0symmetric Eigenvalue Complementarity Problem. <i>Computational Optimization and Applications<\/i>, 2012, 51 (3), pp.1097 - 1117. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10589-010-9388-5\">&#x27E8;10.1007\/s10589-010-9388-5&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636682v1\">&#x27E8;hal-01636682&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636682v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2010<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Nalan Gulpinar, Hoai An Le Thi, Mahdi Moeini. Robust investment strategies with discrete asset choice constraints using DC programming. <i>Optimization<\/i>, 2010, 59 (1), pp.45 - 62. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1080\/02331930903500274\">&#x27E8;10.1080\/02331930903500274&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636742v1\">&#x27E8;hal-01636742&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636742v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2009<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Hoai An Le Thi, Mahdi Moeini, Tao Pham Dinh. Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA. <i>Computational Management Science<\/i>, 2009, 6 (4), pp.459 - 475. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10287-009-0098-3\">&#x27E8;10.1007\/s10287-009-0098-3&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636746v1\">&#x27E8;hal-01636746&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636746v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Hoai An Le Thi, Mahdi Moeini, Tao Pham Dinh. DC programming approach for portfolio optimization under step increasing transaction costs. <i>Optimization<\/i>, 2009, 58 (3), pp.267 - 289. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1080\/02331930902741721\">&#x27E8;10.1080\/02331930902741721&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636747v1\">&#x27E8;hal-01636747&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.univ-lorraine.fr\/hal-01636747v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='Rubrique'>Communication dans un congr\u00e8s<\/p>\n<p class='SousRubrique'>2026<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Emre \u00d6nal. Environmental monitoring by deploying autonomous unmanned vehicles. <i>ROADEF 2026<\/i>, Universit\u00e9 de Tours [UT], Feb 2026, Tours, France. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05534874v1\">&#x27E8;hal-05534874&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-05534874\/file\/GmCSP_VC_for_Roadef_2026.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-05534874\/file\/GmCSP_VC_for_Roadef_2026.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-05534874\/file\/GmCSP_VC_for_Roadef_2026.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-05534874v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2025<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini. Routing a truck and its autonomous supporting vehicles in humanitarian relief distribution. <i>26\u00e8me \u00e9dition du congr\u00e8s annuel de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d\u2019Aide \u00e0 la D\u00e9cision (Roadef)<\/i>, Roadef, Feb 2025, Champs sur Marne, Paris, France. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-05464118v1\">&#x27E8;hal-05464118&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-05464118\/file\/VRP-SD-Roadef2025_Mahdi-MOEINI.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-05464118\/file\/VRP-SD-Roadef2025_Mahdi-MOEINI.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-05464118\/file\/VRP-SD-Roadef2025_Mahdi-MOEINI.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-05464118v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>2023<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Oliver Wendt, Marius Schummer. A Simulated annealing algorithm for the vehicle routing problem with drones. <i>24\u00e8me congr\u00e8s annuel de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d'Aide \u00e0 la D\u00e9cision (ROADEF)<\/i>, Feb 2023, Rennes, France. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04297708v1\">&#x27E8;hal-04297708&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-04297708v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2016<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Daniel Schermer, Oliver Wendt. Swarm of agents for guarding an Art Gallery: A computational study. <i>2016 IEEE Symposium Series on Computational Intelligence (SSCI)<\/i>, Dec 2016, Athens, France. pp.1-8, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/SSCI.2016.7850164\">&#x27E8;10.1109\/SSCI.2016.7850164&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848566v1\">&#x27E8;hal-03848566&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848566v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2014<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Sophie Michel, Serigne Gueye. G\u00e9n\u00e9ration de colonnes pour la r\u00e9solution d'un probl\u00e8me d'allocation de postes d'amarrage (Berth Allocation Problem (BAP)). <i>ROADEF - 15\u00e8me congr\u00e8s annuel de la Soci\u00e9t\u00e9 fran\u00e7aise de recherche op\u00e9rationnelle et d'aide \u00e0 la d\u00e9cision<\/i>, Soci\u00e9t\u00e9 fran\u00e7aise de recherche op\u00e9rationnelle et d'aide \u00e0 la d\u00e9cision, Feb 2014, Bordeaux, France. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-00946338v1\">&#x27E8;hal-00946338&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-00946338v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2013<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Zied Jemai, Evren Sahin. An Integer Programming Model for the Dynamic Location and Relocation of Emergency Vehicles: A Case Study. <i>12th International Symposium on Operational Research (SOR '13) <\/i>, Sep 2013, Dolenjske Toplice, Slovenia. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-01786816v1\">&#x27E8;hal-01786816&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-01786816v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2011<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Hoai An Le Thi. A DC programming approach for the constrained two-dimensional non-guillotine cutting problem. <i>International Conference on Industrial Engineering and Systems Management IESM 2011<\/i>, May 2011, Metz, France. <a target=\"_blank\" href=\"https:\/\/hal.univ-lorraine.fr\/hal-03214411v1\">&#x27E8;hal-03214411&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.univ-lorraine.fr\/hal-03214411v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2010<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Hoai An Le Thi. Branch and Bound for nonconvex SIP. <i>Toulouse Global Optimization workshop (TOGO)<\/i>, 2010, Toulouse, France. pp.113-118. <a target=\"_blank\" href=\"https:\/\/hal.univ-lorraine.fr\/hal-03214425v1\">&#x27E8;hal-03214425&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.univ-lorraine.fr\/hal-03214425v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2006<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Hoai An Le Thi, Mahdi Moeini. Portfolio Selection Under Buy-In Threshold Constraints Using DC Programming and DCA. <i>2006 International Conference on Service Systems and Service Management<\/i>, Oct 2006, Troyes, France. pp.296-300, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/ICSSSM.2006.320630\">&#x27E8;10.1109\/ICSSSM.2006.320630&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.univ-lorraine.fr\/hal-03214463v1\">&#x27E8;hal-03214463&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.univ-lorraine.fr\/hal-03214463v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='Rubrique'>Chapitre d'ouvrage<\/p>\n<p class='SousRubrique'>2024<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Do Thanh Dat Le. Multiple traveling salesman problem with\u00a0a\u00a0drone station: using multi-package payload compartments. <i>Recent Challenges in Intelligent Information and Database Systems<\/i>, 2144, Springer Nature Singapore, pp.226-237, 2024, Communications in Computer and Information Science, 978-981-97-5937-8. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-981-97-5937-8_19\">&#x27E8;10.1007\/978-981-97-5937-8_19&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04853697v1\">&#x27E8;hal-04853697&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-04853697v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini. Optimizing airline pilots training plans: a mixed integer linear programming approach. <i>Recent Challenges in Intelligent Information and Database Systems<\/i>, 2144, Springer Nature Singapore, pp.289-301, 2024, Communications in Computer and Information Science, 978-981-97-5936-1. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-981-97-5937-8_24\">&#x27E8;10.1007\/978-981-97-5937-8_24&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04853701v1\">&#x27E8;hal-04853701&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-04853701v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2021<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Lukas Mees. Automated Tour Planning for Driving Service of Children with Disabilities: A Web-Based Platform and a Case Study. <i>Computational Logistics<\/i>, 13004, Springer International Publishing, pp.456-470, 2021, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-87672-2_30\">&#x27E8;10.1007\/978-3-030-87672-2_30&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848427v1\">&#x27E8;hal-03848427&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848427v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2020<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Hagen Salewski. A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem. <i>Optimization of Complex Systems: Theory, Models, Algorithms and Applications<\/i>, 991, Springer International Publishing, pp.1023-1032, 2020, Advances in Intelligent Systems and Computing, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-21803-4_101\">&#x27E8;10.1007\/978-3-030-21803-4_101&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848602v1\">&#x27E8;hal-03848602&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848602v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Daniel Schermer, Mahdi Moeini, Oliver Wendt. The Traveling Salesman Drone Station Location Problem. <i>Optimization of Complex Systems: Theory, Models, Algorithms and Applications<\/i>, 991, Springer International Publishing, pp.1129-1138, 2020, Advances in Intelligent Systems and Computing, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-21803-4_111\">&#x27E8;10.1007\/978-3-030-21803-4_111&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848600v1\">&#x27E8;hal-03848600&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848600v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2019<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini. Orthogonal Bandit Learning for Portfolio Selection Under Cardinality Constraint. <i>Computational Science and Its Applications \u2013 ICCSA 2019<\/i>, 11621, Springer International Publishing, pp.232-248, 2019, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-24302-9_17\">&#x27E8;10.1007\/978-3-030-24302-9_17&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848604v1\">&#x27E8;hal-03848604&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848604v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2018<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Linus Krumrey, Mahdi Moeini, Oliver Wendt. A Cash-Flow-Based Optimization Model for Corporate Cash Management: A Monte-Carlo Simulation Approach. <i>Advanced Computational Methods for Knowledge Engineering<\/i>, 629, Springer International Publishing, pp.34-46, 2018, Advances in Intelligent Systems and Computing, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-61911-8_4\">&#x27E8;10.1007\/978-3-319-61911-8_4&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848578v1\">&#x27E8;hal-03848578&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848578v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Oliver Wendt. A Heuristic for Solving the Maximum Dispersion Problem. <i>Operations Research Proceedings 2016<\/i>, Springer International Publishing, pp.405-410, 2018, Operations Research Proceedings, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-55702-1_54\">&#x27E8;10.1007\/978-3-319-55702-1_54&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848574v1\">&#x27E8;hal-03848574&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848574v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, David Goerzen, Oliver Wendt. A Local Search Heuristic for Solving the Maximum Dispersion Problem. <i>Intelligent Information and Database Systems<\/i>, 10751, Springer International Publishing, pp.362-371, 2018, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-75417-8_34\">&#x27E8;10.1007\/978-3-319-75417-8_34&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848594v1\">&#x27E8;hal-03848594&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848594v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Daniel Schermer, Mahdi Moeini, Oliver Wendt. Algorithms for Solving the Vehicle Routing Problem with Drones. <i>Intelligent Information and Database Systems<\/i>, 10751, Springer International Publishing, pp.352-361, 2018, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-75417-8_33\">&#x27E8;10.1007\/978-3-319-75417-8_33&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848596v1\">&#x27E8;hal-03848596&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848596v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2017<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Daniel Schermer, Oliver Wendt. A Hybrid Evolutionary Approach for Solving the Traveling Thief Problem. <i>Computational Science and Its Applications \u2013 ICCSA 2017<\/i>, 10405, Springer International Publishing, pp.652-668, 2017, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-62395-5_45\">&#x27E8;10.1007\/978-3-319-62395-5_45&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848579v1\">&#x27E8;hal-03848579&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848579v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2016<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Oliver Wendt, Linus Krumrey. Portfolio Optimization by Means of a $$\\chi $$ -Armed Bandit Algorithm. <i>Intelligent Information and Database Systems<\/i>, 9622, Springer Berlin Heidelberg, pp.620-629, 2016, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-662-49390-8_60\">&#x27E8;10.1007\/978-3-662-49390-8_60&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848567v1\">&#x27E8;hal-03848567&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848567v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='SousRubrique'>2015<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Serigne Gueye, Sophie Michel, Mahdi Moeini. Adjacency Variables Formulation for the Minimum Linear Arrangement Problem. Pinson, Eric and Valente, Fernando and Vitoriano, Bego\u00f1a. <i>Operations Research and Enterprise Systems<\/i>, 509, Springer International Publishing, pp.95--107, 2015, 978-3-319-17508-9 978-3-319-17509-6. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-17509-6_7\">&#x27E8;10.1007\/978-3-319-17509-6_7&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02304510v1\">&#x27E8;hal-02304510&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-02304510v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini. The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results. <i>Modelling, Computation and Optimization in Information Systems and Management Sciences<\/i>, 359, Springer International Publishing, pp.215-227, 2015, Advances in Intelligent Systems and Computing, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-18161-5_19\">&#x27E8;10.1007\/978-3-319-18161-5_19&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848531v1\">&#x27E8;hal-03848531&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848531v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Balal Karimi, Esmaile Khorram. A Cross-Efficiency Approach for Evaluating Decision Making Units in Presence of Undesirable Outputs. <i>Modelling, Computation and Optimization in Information Systems and Management Sciences<\/i>, 360, Springer International Publishing, pp.487-498, 2015, Advances in Intelligent Systems and Computing, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-18167-7_42\">&#x27E8;10.1007\/978-3-319-18167-7_42&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-03848563v1\">&#x27E8;hal-03848563&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-03848563v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='Rubrique'>Ouvrages<\/p>\n<p class='SousRubrique'>2015<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Serigne Gueye, Sophie Michel, Mahdi Moeini (Dir.). Adjacency Variables Formulation for the Minimum Linear Arrangement Problem. Pinson, Eric and Valente, Fernando and Vitoriano, Bego\u00f1a. Springer International Publishing, 509, pp.95--107, 2015, 978-3-319-17508-9 978-3-319-17509-6. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-17509-6_7\">&#x27E8;10.1007\/978-3-319-17509-6_7&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-02464014v1\">&#x27E8;hal-02464014&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-02464014v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='Rubrique'>Proceedings\/Recueil des communications<\/p>\n<p class='SousRubrique'>2023<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Oliver Wendt, Marius Schummer. A Bi-objective routing problem with\u00a0trucks and\u00a0drones: minimizing mission time and\u00a0energy consumption. <i>ICCSA 2023: Computational Science and Its Applications<\/i>, 14106, Springer Nature Switzerland, pp.291-308, 2023, Lecture Notes in Computer Science, 978-3-031-37111-0. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-37111-0_21\">&#x27E8;10.1007\/978-3-031-37111-0_21&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04259774v1\">&#x27E8;hal-04259774&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\">\n<a href=\"https:\/\/hal.science\/hal-04259774v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/dd>\n<\/dl>\n<p class='Rubrique'>Th\u00e8se<\/p>\n<p class='SousRubrique'>2008<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini. La programmation DC et DCA pour l'optimisation de portefeuille. Economies et finances. Universit\u00e9 Paul Verlaine - Metz, 2008. Fran\u00e7ais. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2008METZ008S\">&#x27E8;NNT : 2008METZ008S&#x27E9;<\/a>. <a target=\"_blank\" href=\"https:\/\/hal.univ-lorraine.fr\/tel-01752570v1\">&#x27E8;tel-01752570&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.univ-lorraine.fr\/tel-01752570\/file\/Moeini.Mahdi.SMZ0808.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.univ-lorraine.fr\/tel-01752570\/file\/Moeini.Mahdi.SMZ0808.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.univ-lorraine.fr\/tel-01752570\/file\/Moeini.Mahdi.SMZ0808.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.univ-lorraine.fr\/tel-01752570v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>Pr\u00e9-publication, Document de travail<\/p>\n<p class='SousRubrique'>2024<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">ref_biblio<\/dt><dd class=\"ValeurRes ref_biblio\">Mahdi Moeini, Daniel Schermer, Oliver Wendt. Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M\u00fcller-Merbach, a Former President of IFORS). 2024. <a target=\"_blank\" href=\"https:\/\/hal.science\/hal-04582375v1\">&#x27E8;hal-04582375&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\">\n<a href=\"https:\/\/hal.science\/hal-04582375\/file\/CascadingTreeKP.pdf\"  target=\"_blank\">\n<img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-04582375\/file\/CascadingTreeKP.pdf\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-04582375\/file\/CascadingTreeKP.pdf\" \/><\/a>\n<span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-04582375v1\/bibtex\" target=\"_self\">\n<img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a>\n<\/span><\/dd>\n<\/dl>\n<\/div>\n<\/p>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":4,"featured_media":4633,"parent":2438,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"ocean_post_layout":"","ocean_both_sidebars_style":"","ocean_both_sidebars_content_width":0,"ocean_both_sidebars_sidebars_width":0,"ocean_sidebar":"","ocean_second_sidebar":"","ocean_disable_margins":"enable","ocean_add_body_class":"","ocean_shortcode_before_top_bar":"","ocean_shortcode_after_top_bar":"","ocean_shortcode_before_header":"","ocean_shortcode_after_header":"","ocean_has_shortcode":"","ocean_shortcode_after_title":"","ocean_shortcode_before_footer_widgets":"","ocean_shortcode_after_footer_widgets":"","ocean_shortcode_before_footer_bottom":"","ocean_shortcode_after_footer_bottom":"","ocean_display_top_bar":"default","ocean_display_header":"default","ocean_header_style":"","ocean_center_header_left_menu":"","ocean_custom_header_template":"","ocean_custom_logo":0,"ocean_custom_retina_logo":0,"ocean_custom_logo_max_width":0,"ocean_custom_logo_tablet_max_width":0,"ocean_custom_logo_mobile_max_width":0,"ocean_custom_logo_max_height":0,"ocean_custom_logo_tablet_max_height":0,"ocean_custom_logo_mobile_max_height":0,"ocean_header_custom_menu":"","ocean_menu_typo_font_family":"","ocean_menu_typo_font_subset":"","ocean_menu_typo_font_size":0,"ocean_menu_typo_font_size_tablet":0,"ocean_menu_typo_font_size_mobile":0,"ocean_menu_typo_font_size_unit":"px","ocean_menu_typo_font_weight":"","ocean_menu_typo_font_weight_tablet":"","ocean_menu_typo_font_weight_mobile":"","ocean_menu_typo_transform":"","ocean_menu_typo_transform_tablet":"","ocean_menu_typo_transform_mobile":"","ocean_menu_typo_line_height":0,"ocean_menu_typo_line_height_tablet":0,"ocean_menu_typo_line_height_mobile":0,"ocean_menu_typo_line_height_unit":"","ocean_menu_typo_spacing":0,"ocean_menu_typo_spacing_tablet":0,"ocean_menu_typo_spacing_mobile":0,"ocean_menu_typo_spacing_unit":"","ocean_menu_link_color":"","ocean_menu_link_color_hover":"","ocean_menu_link_color_active":"","ocean_menu_link_background":"","ocean_menu_link_hover_background":"","ocean_menu_link_active_background":"","ocean_menu_social_links_bg":"","ocean_menu_social_hover_links_bg":"","ocean_menu_social_links_color":"","ocean_menu_social_hover_links_color":"","ocean_disable_title":"default","ocean_disable_heading":"default","ocean_post_title":"","ocean_post_subheading":"","ocean_post_title_style":"","ocean_post_title_background_color":"","ocean_post_title_background":0,"ocean_post_title_bg_image_position":"","ocean_post_title_bg_image_attachment":"","ocean_post_title_bg_image_repeat":"","ocean_post_title_bg_image_size":"","ocean_post_title_height":0,"ocean_post_title_bg_overlay":0.5,"ocean_post_title_bg_overlay_color":"","ocean_disable_breadcrumbs":"default","ocean_breadcrumbs_color":"","ocean_breadcrumbs_separator_color":"","ocean_breadcrumbs_links_color":"","ocean_breadcrumbs_links_hover_color":"","ocean_display_footer_widgets":"default","ocean_display_footer_bottom":"default","ocean_custom_footer_template":"","footnotes":""},"class_list":["post-4634","page","type-page","status-publish","has-post-thumbnail","hentry","entry","has-media"],"_links":{"self":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/4634","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/comments?post=4634"}],"version-history":[{"count":0,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/4634\/revisions"}],"up":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/pages\/2438"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/media\/4633"}],"wp:attachment":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/media?parent=4634"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}