2 citations · 2 across the 1 of their papers we have counts for
1 paper
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…