Vahid Roostapour

According to our database, Vahid Roostapour authored at least 13 papers between 2015 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints.

Vahid Roostapour, Aneta Neumann, Frank Neumann

Theor. Comput. Sci., 2022

2020

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.

Frank Neumann, Mojgan Pourhassan, Vahid Roostapour

Proceedings of the Theory of Evolutionary Computation, 2020

Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem.

Mojgan Pourhassan, Vahid Roostapour, Frank Neumann

Theor. Comput. Sci., 2020

Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem.

Vahid Roostapour, Aneta Neumann, Frank Neumann

CoRR, 2020

Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem.

Vahid Roostapour, Jakob Bossek, Frank Neumann

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019

Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem.

Mojgan Pourhassan, Vahid Roostapour, Frank Neumann

CoRR, 2019

Analysis of baseline evolutionary algorithms for the packing while travelling problem.

Vahid Roostapour, Mojgan Pourhassan, Frank Neumann

Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees.

Wanru Gao, Mojgan Pourhassan, Vahid Roostapour, Frank Neumann

Proceedings of the Evolutionary Multi-Criterion Optimization, 2019

Pareto Optimization for Subset Selection with Dynamic Cost Constraints.

Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.

Vahid Roostapour, Mojgan Pourhassan, Frank Neumann

CoRR, 2018

On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem.

Vahid Roostapour, Aneta Neumann, Frank Neumann

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2017

Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem.

Mojgan Pourhassan, Vahid Roostapour, Frank Neumann

Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017

2015

Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem.

Vahid Roostapour, Iman Kiarazm, Mansoor Davoodi

Proceedings of the Topics in Theoretical Computer Science, 2015