23 citations · 90 across the 22 of their papers we have counts for
1 paper · 2 filters
Paul Swoboda, Jan Kuske, Bogdan Savchynskyy
We propose a general dual ascent framework for Lagrangean decomposition of combinatorial problems. Although methods of this type have shown their efficiency for a number of problem…