Frank Neumann

Venues

Frequent coauthors

Papers

1. A Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples
   GECCO 2026 ·

   Joshua D. Knowles

   DBLP profile ↗ORCID search ↗
2. Block-Bench: A Framework for Controllable and Transparent Discrete Optimization Benchmarking
   GECCO 2026 ·

   Furong Ye

   DBLP profile ↗ORCID search ↗
3. Effective Traveling for Metric Instances of the Traveling Thief Problem
   PPSN 2026 ·

   Jan Eube

   DBLP profile ↗ORCID search ↗
4. Evolutionary Algorithms and Multi-objective Minimum Spanning Trees with Limited Distinct Weight Values
   PPSN 2026 ·

   Narges Tavassoli Kejani

   DBLP profile ↗ORCID search ↗
5. Evolutionary Algorithms for Generating Graphs Matching Desired Laplacian Spectra
   GECCO 2026 ·

   Hendrik Richter

   DBLP profile ↗ORCID search ↗
6. Hot of the Press: Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem
   GECCO 2026 ·

   Duc-Cuong Dang

   DBLP profile ↗ORCID search ↗
7. Hot off the Press: Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
   GECCO 2026 ·

   Denis Antipov

   DBLP profile ↗ORCID search ↗
8. Insights from Multi-tasking the EAX Algorithm for the Travelling Salesperson Problem
   PPSN 2026 ·

   Liam Wigney

   DBLP profile ↗ORCID search ↗
9. Multitask Pareto Optimization for Monotone Submodular Problems with Dynamic Constraints
   PPSN 2026 ·

   Liam Wigney

   DBLP profile ↗ORCID search ↗
10. The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics
    PPSN 2026 ·

    Helen Yuliana Angmalisang

    DBLP profile ↗ORCID search ↗
11. Evolutionary Multitasking for the Scenario-based Travelling Thief Problem
    GECCO 2025 ·

    Thilina Pathirage Don

    DBLP profile ↗ORCID search ↗
12. Evolutionary computation for stochastic problems
    GECCO 2025 · Frank Neumann
13. Evolving Diverse Differentiating Stochastic Constraints Using Multi-objective Indicators
    GECCO 2025 ·

    Saba Sadeghi Ahouei

    DBLP profile ↗ORCID search ↗
14. Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms
    GECCO 2025 ·

    Shuaiqun Pan

    DBLP profile ↗ORCID search ↗
15. On the Use of Matching Algorithms to Transfer Solutions for the Travelling Salesperson Problem
    GECCO 2025 ·

    Liam Wigney

    DBLP profile ↗ORCID search ↗
16. Quality Diversity Genetic Programming for Learning Scheduling Heuristics
    GECCO 2025 ·

    Meng Xu

    DBLP profile ↗ORCID search ↗
17. Runtime Analysis of Evolutionary Multitasking for Classical Benchmark Problems
    GECCO 2025 ·

    Johannes Lengler

    DBLP profile ↗ORCID search ↗
18. Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem
    IJCAI 2025 ·

    Duc-Cuong Dang

    DBLP profile ↗ORCID search ↗
19. Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem
    PPSN 2024 ·

    Jonathan Gadea Harder

    DBLP profile ↗ORCID search ↗
20. Archive-Based Single-Objective Evolutionary Algorithms for Submodular Optimization
    PPSN 2024 · Frank Neumann
21. Evolutionary Multi-objective Diversity Optimization
    PPSN 2024 ·

    Anh Viet Do

    DBLP profile ↗ORCID search ↗
22. Limited Query Graph Connectivity Test
    AAAI 2024 ·

    Mingyu Guo

    DBLP profile ↗ORCID search ↗
23. Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential
    PPSN 2024 ·

    Denis Antipov

    DBLP profile ↗ORCID search ↗
24. Multi-objective Evolutionary Approaches for the Knapsack Problem with Stochastic Profits
    PPSN 2024 ·

    Kokila Kasuni Perera

    DBLP profile ↗ORCID search ↗
25. Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem
    PPSN 2024 ·

    Denis Antipov

    DBLP profile ↗ORCID search ↗
26. Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints
    PPSN 2024 · Frank Neumann
27. Sliding Window Bi-objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions
    PPSN 2024 ·

    Xiankun Yan

    DBLP profile ↗ORCID search ↗