Frank Neumann
5 papers · Latest:
Analysis of Multitasking Pareto Optimization for Monotone Submodular Problems
This paper introduces multitasking Pareto optimization for monotone submodular problems with shared functions but different knapsack constraints, significantly improving efficiency.
On the Use of Iterative Problem Solving for the Traveling Salesperson Problem with Changing Time Window Constraints
An iterative approach for TSPTW with changing time windows consistently outperforms solving related tasks from scratch, especially for harder instances.
Greedy Approaches for Packing While Travelling with Deterministic and Stochastic Constraints
New greedy reward functions and a hyper-heuristic framework improve Packing While Travelling problem solutions for deterministic and stochastic constraints.
Block-Bench: A Framework for Controllable and Transparent Discrete Optimization Benchmarking
Block-Bench is a novel framework for discrete optimization benchmarking, offering fine-grained control over problem properties and transparent algorithm analysis.
The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics
This paper introduces the Traveling Thief Problem with Time Windows (TTPTW), provides new benchmarks, and proposes a superior heuristic.
📬 Weekly AI Paper Digest
Get the top 10 AI/ML arXiv papers from the week — summarized, scored, and delivered to your inbox every Monday.