Agents: read llms.txt

Research-level output at startup velocity.

PhD computer scientist. Three-time founder in Copenhagen, two companies acquired. Twenty years of optimization and engineering — routing, scheduling, network flow. Friends with agents, fast-paced 0 → 1.

Selected work

Three commodities routed over a shared capacitated logistics network

Flowty

Solver · logistics · 2019 – 2026

An optimization solver for planning and scheduling in logistics: multi-commodity flow, vehicle routing and resource-constrained shortest path, solved by branch-cut-and-price. Scheduling delivered in production with the Ørsted team, with industry pilots at DHL, Svitzer and Unifeeder.

In 2008, the #1 exact algorithm for vehicle routing with time windows

\sum_{p \in P} \left\lfloor \tfrac{1}{k} \sum_{i \in S} a_{ip} \right\rfloor \lambda_p \le \left\lfloor \tfrac{|S|}{k} \right\rfloor

Subset-row inequalities

Paper · Operations Research · 2008

Introduced with Jepsen, Petersen and Pisinger; 600+ citations. The branch-cut-and-price algorithm built on these cuts closed 8 Solomon benchmark instances that had stood unsolved.

up to 3.3M commodities1.4–1.9×faster than path-based; 99× at the largest