Reproduce “Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.