Multiple Traveling Salesman Problem with a Drone Station: Using Multi-package Payload Compartments.

Mahdi Moeini https://orcid.org/0000-0001-6940-7691 Mahdi Moeini Do Thanh Dat Le Multiple Traveling Salesman Problem with a Drone Station: Using Multi-package Payload Compartments. 226-237 2024 ACIIDS (Companion 1) https://doi.org/10.1007/978-981-97-5937-8_19 conf/aciids/2024c1 db/conf/aciids/aciids2024c1.html#MoeiniL24 Mahdi Moeini Optimizing Airline Pilots Training Plans: A Mixed Integer Linear Programming Approach. 289-301 2024 ACIIDS (Companion 1) https://doi.org/10.1007/978-981-97-5937-8_24 conf/aciids/2024c1 db/conf/aciids/aciids2024c1.html#Moeini24

Mahdi Moeini Daniel Schermer Oliver Wendt Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner Müller-Merbach, a Former President of IFORS). 2024 abs/2405.13450 CoRR https://doi.org/10.48550/arXiv.2405.13450 db/journals/corr/corr2405.html#abs-2405-13450

Konstantin Kloster Mahdi Moeini Daniele Vigo Oliver Wendt The multiple traveling salesman problem in presence of drone- and robot-supported packet stations. 630-643 2023 305 Eur. J. Oper. Res. 2 https://doi.org/10.1016/j.ejor.2022.06.004 db/journals/eor/eor305.html#KlosterMVW23

Mahdi Moeini Oliver Wendt Marius Schummer A Bi-objective Routing Problem with Trucks and Drones: Minimizing Mission Time and Energy Consumption. 291-308 2023 ICCSA (Workshops 3) https://doi.org/10.1007/978-3-031-37111-0_21 conf/iccsa/2023-w3 db/conf/iccsa/iccsa2023-w3.html#MoeiniWS23

Mahdi Moeini Solving the index tracking problem: a continuous optimization approach. 807-835 2022 30 Central Eur. J. Oper. Res. 2 https://doi.org/10.1007/s10100-019-00633-0 https://www.wikidata.org/entity/Q127466995 db/journals/cejor/cejor30.html#Moeini22

Mahdi Moeini Lukas Mees Automated Tour Planning for Driving Service of Children with Disabilities: A Web-Based Platform and a Case Study. 456-470 2021 ICCL https://doi.org/10.1007/978-3-030-87672-2_30 conf/iccl2/2021 db/conf/iccl2/iccl2021.html#MoeiniM21

Daniel Schermer Mahdi Moeini Oliver Wendt A branch-and-cut approach and alternative formulations for the traveling salesman problem with drone. 164-186 2020 76 Networks 2 https://doi.org/10.1002/net.21958 db/journals/networks/networks76.html#SchermerMW20

Daniel Schermer Mahdi Moeini Oliver Wendt The Drone-Assisted Traveling Salesman Problem with Robot Stations. 1-10 2020 HICSS https://hdl.handle.net/10125/63900 conf/hicss/2020 db/conf/hicss/hicss2020.html#SchermerMW20

Daniel Schermer Mahdi Moeini Oliver Wendt A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations. 134-158 2019 109 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2019.04.021 https://www.wikidata.org/entity/Q127937402 db/journals/cor/cor109.html#SchermerMW19

Mahdi Moeini Orthogonal Bandit Learning for Portfolio Selection Under Cardinality Constraint. 232-248 2019 ICCSA (3) https://doi.org/10.1007/978-3-030-24302-9_17 conf/iccsa/2019-3 db/conf/iccsa/iccsa2019-3.html#Moeini19 Mahdi Moeini Hagen Salewski A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem. 1023-1032 2019 WCGO https://doi.org/10.1007/978-3-030-21803-4_101 conf/wcgo/2019 db/conf/wcgo/wcgo2019.html#MoeiniS19 Daniel Schermer Mahdi Moeini Oliver Wendt The Traveling Salesman Drone Station Location Problem. 1129-1138 2019 WCGO https://doi.org/10.1007/978-3-030-21803-4_111 conf/wcgo/2019 db/conf/wcgo/wcgo2019.html#SchermerMW19 Daniel Schermer Mahdi Moeini Oliver Wendt Algorithms for Solving the Vehicle Routing Problem with Drones. 352-361 2018 ACIIDS (1) https://doi.org/10.1007/978-3-319-75417-8_33 conf/aciids/2018-1 db/conf/aciids/aciids2018-1.html#SchermerMW18 Mahdi Moeini David Goerzen Oliver Wendt A Local Search Heuristic for Solving the Maximum Dispersion Problem. 362-371 2018 ACIIDS (1) https://doi.org/10.1007/978-3-319-75417-8_34 conf/aciids/2018-1 db/conf/aciids/aciids2018-1.html#MoeiniGW18

Dominik Goeke Mahdi Moeini David Poganiuch A Variable Neighborhood Search heuristic for the maximum ratio clique problem. 283-291 2017 87 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2017.01.010 db/journals/cor/cor87.html#GoekeMP17

Maximilian Ernestus Stephan Friedrichs Michael Hemmer Jan Kokemüller Alexander Kröller Mahdi Moeini Christiane Schmidt 0001 Algorithms for art gallery illumination. 23-45 2017 68 J. Glob. Optim. 1 https://doi.org/10.1007/s10898-016-0452-2 https://www.wikidata.org/entity/Q59529122 db/journals/jgo/jgo68.html#ErnestusFHKKMS17

Mahdi Moeini Daniel Schermer Oliver Wendt A Hybrid Evolutionary Approach for Solving the Traveling Thief Problem. 652-668 2017 ICCSA (2) https://doi.org/10.1007/978-3-319-62395-5_45 conf/iccsa/2017-2 db/conf/iccsa/iccsa2017-2.html#MoeiniSW16 Linus Krumrey Mahdi Moeini Oliver Wendt A Cash-Flow-Based Optimization Model for Corporate Cash Management: A Monte-Carlo Simulation Approach. 34-46 2017 ICCSAMA https://doi.org/10.1007/978-3-319-61911-8_4 conf/iccsama/2017 db/conf/iccsama/iccsama2017.html#KrumreyMW17

Balal Karimi Esmaile Khorram Mahdi Moeini Identification of congestion by means of integer-valued data envelopment analysis. 513-521 2016 98 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2016.06.017 db/journals/candie/candie98.html#KarimiKM16

Mahdi Moeini Oliver Wendt Linus Krumrey Portfolio Optimization by Means of a \chi -Armed Bandit Algorithm. 620-629 2016 ACIIDS (2) https://doi.org/10.1007/978-3-662-49390-8_60 conf/aciids/2016-2 db/conf/aciids/aciids2016-2.html#MoeiniWK16 Mahdi Moeini Oliver Wendt A Heuristic for Solving the Maximum Dispersion Problem. 405-410 2016 OR https://doi.org/10.1007/978-3-319-55702-1_54 conf/or/2016 db/conf/or/or2016.html#MoeiniW16 Mahdi Moeini Daniel Schermer Oliver Wendt Swarm of agents for guarding an Art Gallery: A computational study. 1-8 2016 SSCI https://doi.org/10.1109/SSCI.2016.7850164 conf/ssci/2016 db/conf/ssci/ssci2016.html#MoeiniSW16

Mahdi Moeini Zied Jemaï Evren Sahin Location and relocation problems in the context of the emergency medical service systems: a case study. 641-658 2015 23 Central Eur. J. Oper. Res. 3 https://doi.org/10.1007/s10100-014-0374-3 db/journals/cejor/cejor23.html#MoeiniJS15

Mahdi Moeini The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results. 215-227 2015 MCO (1) https://doi.org/10.1007/978-3-319-18161-5_19 conf/mco/2015-1 db/conf/mco/mco2015-1.html#Moeini15 Mahdi Moeini Balal Karimi Esmaile Khorram A Cross-Efficiency Approach for Evaluating Decision Making Units in Presence of Undesirable Outputs. 487-498 2015 MCO (2) https://doi.org/10.1007/978-3-319-18167-7_42 conf/mco/2015-2 db/conf/mco/mco2015-2.html#MoeiniKK15

Hoai An Le Thi Mahdi Moeini Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm. 199-224 2014 161 J. Optim. Theory Appl. 1 https://doi.org/10.1007/s10957-012-0197-0 db/journals/jota/jota161.html#ThiM14

Mahdi Moeini Serigne Gueye Sophie Michel Loyal A New Mathematical Model For the Minimum Linear Arrangement Problem. 57-62 2014 ICORES https://doi.org/10.5220/0004827800570062 conf/icores/2014 db/conf/icores/icores2014.html#MoeiniGL14 Serigne Gueye Sophie Michel Loyal Mahdi Moeini Adjacency Variables Formulation for the Minimum Linear Arrangement Problem. 95-107 2014 ICORES (Selected Papers) https://doi.org/10.1007/978-3-319-17509-6_7 conf/icores/2014s db/conf/icores/icores2014s.html#GueyeLM14

Mahdi Moeini Zied Jemaï Evren Sahin An Integer Programming Model for the Dynamic Location and Relocation of Emergency Vehicles: A Case Study. 2014 abs/1404.3285 CoRR http://arxiv.org/abs/1404.3285 db/journals/corr/corr1404.html#MoeiniJS14

Mahdi Moeini A Continuous Optimization Approach for the Financial Portfolio Selection under Discrete Asset Choice Constraints. 2014 abs/1404.3286 CoRR http://arxiv.org/abs/1404.3286 db/journals/corr/corr1404.html#Moeini14

Hoai An Le Thi Mahdi Moeini Portfolio Selection Under Buy-In Threshold Constraints Using DC Programming and DCA. 2014 abs/1404.3329 CoRR http://arxiv.org/abs/1404.3329 db/journals/corr/corr1404.html#ThiM14

Mahdi Moeini Hoai An Le Thi A DC programming approach for constrained two-dimensional non-guillotine cutting problem. 2014 abs/1404.3330 CoRR http://arxiv.org/abs/1404.3330 db/journals/corr/corr1404.html#MoeiniT14

Maximilian Ernestus Stephan Friedrichs Michael Hemmer Jan Kokemüller Alexander Kröller Mahdi Moeini Christiane Schmidt 0001 Algorithms for Art Gallery Illumination. 2014 abs/1410.5952 CoRR http://arxiv.org/abs/1410.5952 db/journals/corr/corr1410.html#ErnestusFHKKMS14

Alexander Kröller Mahdi Moeini Christiane Schmidt 0001 A Novel Efficient Approach for Solving the Art Gallery Problem. 5-16 2013 WALCOM https://doi.org/10.1007/978-3-642-36065-7_3 conf/walcom/2013 db/conf/walcom/walcom2013.html#KrollerMS13

Le Thi Hoai An Mahdi Moeini Tao Pham Dinh Joaquim Júdice A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem. 1097-1117 2012 51 Comput. Optim. Appl. 3 https://doi.org/10.1007/s10589-010-9388-5 db/journals/coap/coap51.html#ThiMDJ12

Hoai An Le Thi Mahdi Moeini Tao Pham Dinh Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA. 459-475 2009 6 Comput. Manag. Sci. 4 https://doi.org/10.1007/s10287-009-0098-3 db/journals/cms/cms6.html#ThiMD09

Le Thi Hoai AnHoai An Le Thi Tao Pham Dinh Maximilian Ernestus Stephan Friedrichs Dominik Goeke David Goerzen Serigne Gueye Michael Hemmer Zied Jemaï Joaquim Júdice Balal Karimi Esmaile Khorram Konstantin Kloster Jan Kokemüller Alexander Kröller Linus Krumrey Do Thanh Dat Le Sophie Michel Loyal Lukas Mees David Poganiuch Evren Sahin Hagen Salewski Daniel Schermer Christiane Schmidt 0001 Marius Schummer Daniele Vigo Oliver Wendt