Major Coverage Tours (with Turn Costs) The optimization of various geometric coverage tour problems with and without turn costs. This is my longest running project with already many publications but still a lot of open questions. Status: Active Configuration Sampling An LNS-based algorithm with lower bound computation for pairwise configuration sampling. This project uses theoretical insights to obtain a practical algorithm that often computes (near-)optimal solutions (with certificates). Status: Active Exact Solvers for TSPN-Variants Engineering exact solvers for Traveling Salesman Problems with Neighborhoods (TSPN) and related problems through the gain and exploitation of theoretical insights. Status: Active Minimum Scan Cover Exploring the Combinatorial Complexities of Synchronizing Directional Antennas' Rotations. The strongest parts of this project are the theoretical results, which are published in the SIAM Journal of Discrete Mathematics Status: Completed Tilt Problems How to control a swarm of particles by a uniform magnetic field to solve problems. Status: Completed Teaching&Community CP-SAT Primer An extensive primer for the constraint programming solver CP-SAT under the CC-BY-4.0 license. Status: Active CG:SHOP Challenges We host optimization challenges for computational geometry problems. The challenges are part of CG Week. Status: Active AlgLab The exercises for the latest Algorithm Lab course at TU Braunschweig. Status: Periodic Collaboration ASIMOV The ESA-project ASIMOV, in collaboration with IRAS, was an exploratory study aimed at enhancing the automation of satellite operations for the future. Status: Completed (2020) ROBUST Robust disease module mining via enumeration of price-collecting Steiner trees Status: Completed, but ideas for extensions. Tools CP-SAT Log Analyzer A webapp that visualizes and annotates your ortools' CP-SAT logs. Partially inspired by gurobi-logtools. slurminade slurminade makes using the workload manager slurm with Python beautiful. CheckMyTex A tool to comfortably check complex LaTeX documents, e.g., dissertations, for common errors. Developed to check the 314 pages of my own dissertation in a structured way. AlgBench Experiment execution and result management for empirical evaluations of algorithms in Python. cpsat-autotune Venturing in hyperparameter tuning for the CP-SAT solver in OR-Tools. Status: WIP skbuild-conan An extension for scikit-build to add C++-dependencies as easily as Python dependencies via conan. Minor Benchmark Selection Evaluating techniques to get a small representative and diverse set of instances for benchmarking optimization algorithms from a large pool of instances. We already used various techniques for the CG:SHOP Challenges but are now trying to generalize and evaluate them. Status: WIP Dispersive AGP Solving the Dispersive Art Gallery Problem to optimality via an incremental SAT-solver. Status: Active Drone Range Assignment Determine the optimal placement of drones and range assignments for both terminals and drones to ensure a strongly connected network among the terminals, with the goal of minimizing the overall power consumption. Status: On hold Edge Sparsification Analyzing how we can sparsify geometric graphs to strongly improve the runtime of algorithms while preserving solution quality. Status: Completed Steiner Swarm Local mechanisms for maintaining a dynamic swarm of robots with limited capabilities and information, in the presence of external forces and permanent node failures. Status: Completed
