Dominik Krupke is an Optimization Algorithm Engineer and postdoctoral researcher with 12 years of experience solving NP-hard problems by blending MIP, CP, SAT, DP, meta-heuristics and graph algorithms—often inside Large Neighborhood Search frameworks. He holds a PhD in Algorithm Engineering from Technische Universität Braunschweig and combines rigorous theoretical foundations with hands-on consulting and deployment experience, delivering end-to-end algorithmic solutions for industry and academia. Dominik splits his time between research, teaching and freelance consulting, enabling rapid translation of novel methods into practical tools for diverse clients. He is known for accessible educational material—his CP-SAT Primer has broad uptake—yet explicitly avoids being tied to a single solver, preferring hybrid, problem-driven toolchains. Based in Hanover, Germany, he has also collaborated internationally (including a research stay in Tel Aviv) and routinely integrates techniques across optimization, OR and software engineering to tackle real-world constraints.
12 years of coding experience
5 years of employment as a software developer
Doctor of Science, Algorithm Engineering, Doctor of Science, Algorithm Engineering at Technische Universität Braunschweig
Contributions:4 releases, 47 commits, 7 PRs in 9 months
python-librarypythonlatex
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.