F. Neumann

From MaRDI portal
Person:319123

Available identifiers

zbMath Open neumann.frank.1WikidataQ51852297 ScholiaQ51852297MaRDI QIDQ319123

List of research outcomes





PublicationDate of PublicationType
Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers2024-02-23Paper
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax2024-02-23Paper
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem2023-03-20Paper
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints2022-06-13Paper
Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation2022-05-16Paper
Solving non-uniform planted and filtered random SAT formulas greedily2022-03-22Paper
Pareto optimization for subset selection with dynamic cost constraints2021-12-13Paper
Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem2021-11-05Paper
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint2021-11-05Paper
Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem2021-11-01Paper
Non-monotone submodular maximization with multiple knapsacks in static and dynamic settings2021-07-06Paper
Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives2021-07-06Paper
Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem2021-04-08Paper
Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints2020-10-12Paper
Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints2020-05-26Paper
Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem2020-05-26Paper
Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation2020-05-26Paper
Runtime analysis of evolutionary algorithms for the depth restricted \((1,2)\)-minimum spanning tree problem2020-02-11Paper
Evolving diverse TSP instances by means of novel and creative mutation operators2020-02-11Paper
Analysis of baseline evolutionary algorithms for the packing while travelling problem2020-02-11Paper
Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem2020-02-11Paper
Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints2019-02-14Paper
Optimizing spatial and tonal data for PDE-based inpainting2018-11-23Paper
The packing while traveling problem2018-05-25Paper
A relation-algebraic view on evolutionary algorithms for some graph problems2018-04-12Paper
Simple max-min ant systems and the optimization of linear pseudo-Boolean functions2017-07-14Paper
Computing single source shortest paths using single-objective fitness2017-07-14Paper
Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms2017-07-14Paper
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics2017-07-14Paper
A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem2017-07-14Paper
Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas2017-07-07Paper
Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints2017-06-13Paper
On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms2017-06-13Paper
Solving hard control problems in voting systems via integer programming2016-10-07Paper
Efficient optimization of many objectives by approximation-guided evolution2016-10-06Paper
Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems2016-07-25Paper
Population size matters: rigorous runtime results for maximizing the hypervolume indicator2014-12-02Paper
The Max problem revisited: the importance of mutation in genetic programming2014-07-10Paper
A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem2014-06-26Paper
Fixed-parameter evolutionary algorithms and the vertex cover problem2013-05-16Paper
More effective crossover operators for the all-pairs shortest path problem2013-02-19Paper
Convergence of set-based multi-objective optimization, indicators and deteriorative cycles2012-10-11Paper
Evolutionary algorithms and dynamic programming2011-12-19Paper
Computing minimum cuts by randomized search heuristics2011-03-30Paper
Runtime analysis of the 1-ANT ant colony optimizer2011-03-29Paper
Illustration of fairness in evolutionary multi-objective optimization2011-03-29Paper
Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity2010-11-18Paper
In memoriam: Ingo Wegener2010-09-27Paper
Approximating Pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization2010-05-28Paper
Ant colony optimization and the minimum spanning tree problem2010-05-27Paper
When to use bit-wise neutrality2010-05-05Paper
Plateaus can be harder in multi-objective optimization2010-02-19Paper
Comparison of simple diversity mechanisms on plateau functions2009-07-10Paper
Runtime analysis of a simple ant colony optimization algorithm2009-06-22Paper
Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization2008-09-18Paper
Multi-objective Problems in Terms of Relational Algebra2008-05-15Paper
Runtime Analysis of a Simple Ant Colony Optimization Algorithm2008-04-24Paper
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem2008-03-11Paper
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions2007-11-29Paper
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem2007-06-06Paper
Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem2007-05-03Paper
Relational Methods in Computer Science2007-05-02Paper
Minimum spanning trees made easier via multi-objective optimization2007-01-25Paper
Computer Algebra in Scientific Computing2006-07-07Paper

Research outcomes over time

This page was built for person: F. Neumann