default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahdi Moeini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]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). CoRR abs/2405.13450 (2024)- 2023
- [j11]Konstantin Kloster
, Mahdi Moeini, Daniele Vigo, Oliver Wendt:
The multiple traveling salesman problem in presence of drone- and robot-supported packet stations. Eur. J. Oper. Res. 305(2): 630-643 (2023) - [c18]Mahdi Moeini, Oliver Wendt, Marius Schummer:
A Bi-objective Routing Problem with Trucks and Drones: Minimizing Mission Time and Energy Consumption. ICCSA (Workshops 3) 2023: 291-308 - 2022
- [j10]Mahdi Moeini:
Solving the index tracking problem: a continuous optimization approach. Central Eur. J. Oper. Res. 30(2): 807-835 (2022) - 2021
- [c17]Mahdi Moeini, Lukas Mees:
Automated Tour Planning for Driving Service of Children with Disabilities: A Web-Based Platform and a Case Study. ICCL 2021: 456-470 - 2020
- [j9]Daniel Schermer, Mahdi Moeini, Oliver Wendt:
A branch-and-cut approach and alternative formulations for the traveling salesman problem with drone. Networks 76(2): 164-186 (2020) - [c16]Daniel Schermer, Mahdi Moeini, Oliver Wendt:
The Drone-Assisted Traveling Salesman Problem with Robot Stations. HICSS 2020: 1-10
2010 – 2019
- 2019
- [j8]Daniel Schermer, Mahdi Moeini, Oliver Wendt:
A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations. Comput. Oper. Res. 109: 134-158 (2019) - [c15]Mahdi Moeini:
Orthogonal Bandit Learning for Portfolio Selection Under Cardinality Constraint. ICCSA (3) 2019: 232-248 - [c14]Mahdi Moeini, Hagen Salewski:
A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem. WCGO 2019: 1023-1032 - [c13]Daniel Schermer, Mahdi Moeini, Oliver Wendt:
The Traveling Salesman Drone Station Location Problem. WCGO 2019: 1129-1138 - 2018
- [c12]Daniel Schermer, Mahdi Moeini, Oliver Wendt:
Algorithms for Solving the Vehicle Routing Problem with Drones. ACIIDS (1) 2018: 352-361 - [c11]Mahdi Moeini, David Goerzen, Oliver Wendt:
A Local Search Heuristic for Solving the Maximum Dispersion Problem. ACIIDS (1) 2018: 362-371 - 2017
- [j7]Dominik Goeke, Mahdi Moeini, David Poganiuch:
A Variable Neighborhood Search heuristic for the maximum ratio clique problem. Comput. Oper. Res. 87: 283-291 (2017) - [j6]Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokemüller, Alexander Kröller, Mahdi Moeini, Christiane Schmidt:
Algorithms for art gallery illumination. J. Glob. Optim. 68(1): 23-45 (2017) - [c10]Mahdi Moeini, Daniel Schermer, Oliver Wendt:
A Hybrid Evolutionary Approach for Solving the Traveling Thief Problem. ICCSA (2) 2017: 652-668 - [c9]Linus Krumrey, Mahdi Moeini, Oliver Wendt:
A Cash-Flow-Based Optimization Model for Corporate Cash Management: A Monte-Carlo Simulation Approach. ICCSAMA 2017: 34-46 - 2016
- [j5]Balal Karimi, Esmaile Khorram, Mahdi Moeini:
Identification of congestion by means of integer-valued data envelopment analysis. Comput. Ind. Eng. 98: 513-521 (2016) - [c8]Mahdi Moeini, Oliver Wendt, Linus Krumrey:
Portfolio Optimization by Means of a \chi -Armed Bandit Algorithm. ACIIDS (2) 2016: 620-629 - [c7]Mahdi Moeini, Oliver Wendt:
A Heuristic for Solving the Maximum Dispersion Problem. OR 2016: 405-410 - [c6]Mahdi Moeini, Daniel Schermer, Oliver Wendt:
Swarm of agents for guarding an Art Gallery: A computational study. SSCI 2016: 1-8 - 2015
- [j4]Mahdi Moeini, Zied Jemaï, Evren Sahin:
Location and relocation problems in the context of the emergency medical service systems: a case study. Central Eur. J. Oper. Res. 23(3): 641-658 (2015) - [c5]Mahdi Moeini:
The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results. MCO (1) 2015: 215-227 - [c4]Mahdi Moeini, Balal Karimi, Esmaile Khorram:
A Cross-Efficiency Approach for Evaluating Decision Making Units in Presence of Undesirable Outputs. MCO (2) 2015: 487-498 - 2014
- [j3]Hoai An Le Thi, Mahdi Moeini:
Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm. J. Optim. Theory Appl. 161(1): 199-224 (2014) - [c3]Mahdi Moeini, Serigne Gueye, Sophie Michel Loyal:
A New Mathematical Model For the Minimum Linear Arrangement Problem. ICORES 2014: 57-62 - [c2]Serigne Gueye, Sophie Michel Loyal, Mahdi Moeini:
Adjacency Variables Formulation for the Minimum Linear Arrangement Problem. ICORES (Selected Papers) 2014: 95-107 - [i5]Mahdi Moeini, Zied Jemaï, Evren Sahin:
An Integer Programming Model for the Dynamic Location and Relocation of Emergency Vehicles: A Case Study. CoRR abs/1404.3285 (2014) - [i4]Mahdi Moeini:
A Continuous Optimization Approach for the Financial Portfolio Selection under Discrete Asset Choice Constraints. CoRR abs/1404.3286 (2014) - [i3]Hoai An Le Thi, Mahdi Moeini:
Portfolio Selection Under Buy-In Threshold Constraints Using DC Programming and DCA. CoRR abs/1404.3329 (2014) - [i2]Mahdi Moeini, Hoai An Le Thi:
A DC programming approach for constrained two-dimensional non-guillotine cutting problem. CoRR abs/1404.3330 (2014) - [i1]Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokemüller, Alexander Kröller, Mahdi Moeini, Christiane Schmidt:
Algorithms for Art Gallery Illumination. CoRR abs/1410.5952 (2014) - 2013
- [c1]Alexander Kröller, Mahdi Moeini, Christiane Schmidt:
A Novel Efficient Approach for Solving the Art Gallery Problem. WALCOM 2013: 5-16 - 2012
- [j2]Le Thi Hoai An, Mahdi Moeini, Tao Pham Dinh, Joaquim Júdice:
A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem. Comput. Optim. Appl. 51(3): 1097-1117 (2012)
2000 – 2009
- 2009
- [j1]Hoai An Le Thi, Mahdi Moeini, Tao Pham Dinh:
Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA. Comput. Manag. Sci. 6(4): 459-475 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
