Leopold Kuttner
Co-Founder at Clover Optimization
Dresden, Saxony, Germany
Summary
👤
Senior🎓
Top SchoolLeopold Kuttner is a co-founder and algorithm engineer with 11 years of experience applying exact and heuristic methods to real-world planning problems like vehicle routing, container loading and distributed energy scheduling. Based in Dresden, he combines academic rigor from a PhD track at TU Dresden with startup execution at Clover Optimization, building optimization software for better transportation planning. His work spans research, teaching and production development, and he actively contributes to open-source projects such as improving the Edmonds-Karp max-flow implementation in QuickGraph for .NET. Leopold’s expertise bridges mathematical optimization and pragmatic engineering—often surfacing subtle implementation issues (e.g., edge handling and value-type exceptions) that improve robustness in deployed systems.
11 years of coding experience
Doktor (Ph.D.), Doktor (Ph.D.) at Technische Universität DresdenAbitur, Abitur at Stiftland-Gymnasium Tirschenreuth
Stackoverflow
245reputation
10kreached
3answers
3questions
Github Skills (18)
algorithm10
graph-algorithms10
net10
dotnet10
data-structure10
asp-net10
data-structures10
csharp10
gurobi6
linear-programming6
boost6
mathematical-optimization6
3d6
sparse-matrix6
bin-packing6
Programming languages (9)
Github contributions (5)
YaccConstructor/QuickGraph
Nov 2018 - Nov 2018
Generic Graph Data Structures and Algorithms for .NET
Role in this project:
Back-end Developer
Back-end DeveloperContributions:5 commits, 1 PR, 4 comments in 1 day
Contributions summary:Leopold primarily focused on improving the Edmonds-Karp maximum flow algorithm within the QuickGraph library. Their contributions included fixing bugs related to the algorithm's implementation and edge handling, and providing alternative solutions to address identified issues. They also added comments and documentation, specifically addressing potential exceptions with value types and providing guidance on the use of auxiliary edges. Additionally, the user corrected an argument in a unit test.
dotnetgraph-dataalgorithms-and-data-structuresgenericcsharp
ktnr/BinPacking2D
Apr 2021 - Sep 2022
Exact solutions to two-dimensional bin packing problems by branch-and-cut
Contributions:1 release, 95 commits, 2 PRs in 1 year 5 months
pythonbranch-and-cutbintwo-dimensionalpacking
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.