The following pages link to Mahdi Moeini (Q301943):
Displaying 17 items.
- Location and relocation problems in the context of the emergency medical service systems: a case study (Q301946) (← links)
- A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495) (← links)
- Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA (Q1035284) (← links)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← links)
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations (Q2003572) (← links)
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
- Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm (Q2247924) (← links)
- Algorithms for art gallery illumination (Q2397430) (← links)
- Solving the index tracking problem: a continuous optimization approach (Q2673302) (← links)
- (Q2943932) (← links)
- Robust investment strategies with discrete asset choice constraints using DC programming (Q3553750) (← links)
- DC programming approach for portfolio optimization under step increasing transaction costs (Q3625227) (← links)
- A Heuristic for Solving the Maximum Dispersion Problem (Q4596481) (← links)
- A Novel Efficient Approach for Solving the Art Gallery Problem (Q4915874) (← links)
- The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results (Q5356986) (← links)
- A Cross-Efficiency Approach for Evaluating Decision Making Units in Presence of Undesirable Outputs (Q5357788) (← links)
- A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone (Q6092656) (← links)
