65 citations · 313 across the 28 of their papers we have counts for
1 paper · 2 filters
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
The multicommodity flow problem is NP-hard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of n-fold integer programming and extensions deve…