Mahdi Moeini

According to our database1, Mahdi Moeini authored at least 27 papers between 2009 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations.
Comput. Oper. Res., 2019

The Traveling Salesman Drone Station Location Problem.
Proceedings of the Optimization of Complex Systems: Theory, 2019

A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Orthogonal Bandit Learning for Portfolio Selection Under Cardinality Constraint.
Proceedings of the Computational Science and Its Applications - ICCSA 2019, 2019

2018
Algorithms for Solving the Vehicle Routing Problem with Drones.
Proceedings of the Intelligent Information and Database Systems - 10th Asian Conference, 2018

A Local Search Heuristic for Solving the Maximum Dispersion Problem.
Proceedings of the Intelligent Information and Database Systems - 10th Asian Conference, 2018

2017
Algorithms for art gallery illumination.
J. Global Optimization, 2017

A Variable Neighborhood Search heuristic for the maximum ratio clique problem.
Comput. Oper. Res., 2017

A Cash-Flow-Based Optimization Model for Corporate Cash Management: A Monte-Carlo Simulation Approach.
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2017

A Hybrid Evolutionary Approach for Solving the Traveling Thief Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016
Identification of congestion by means of integer-valued data envelopment analysis.
Comput. Ind. Eng., 2016

Swarm of agents for guarding an Art Gallery: A computational study.
Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

A Heuristic for Solving the Maximum Dispersion Problem.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

Portfolio Optimization by Means of a \chi -Armed Bandit Algorithm.
Proceedings of the Intelligent Information and Database Systems - 8th Asian Conference, 2016

2015
Location and relocation problems in the context of the emergency medical service systems: a case study.
CEJOR, 2015

A Cross-Efficiency Approach for Evaluating Decision Making Units in Presence of Undesirable Outputs.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

2014
Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm.
J. Optimization Theory and Applications, 2014

Portfolio Selection Under Buy-In Threshold Constraints Using DC Programming and DCA.
CoRR, 2014

A DC programming approach for constrained two-dimensional non-guillotine cutting problem.
CoRR, 2014

An Integer Programming Model for the Dynamic Location and Relocation of Emergency Vehicles: A Case Study.
CoRR, 2014

A Continuous Optimization Approach for the Financial Portfolio Selection under Discrete Asset Choice Constraints.
CoRR, 2014

A New Mathematical Model For the Minimum Linear Arrangement Problem.
Proceedings of the ICORES 2014, 2014

Adjacency Variables Formulation for the Minimum Linear Arrangement Problem.
Proceedings of the Operations Research and Enterprise Systems, 2014

2013
A Novel Efficient Approach for Solving the Art Gallery Problem.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012
A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem.
Comp. Opt. and Appl., 2012

2009
Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA.
Comput. Manag. Science, 2009


  Loading...