Jan Kuske

A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems

We propose a general dual ascent (message passing) framework for Lagrangean (dual) decomposition of combinatorial problems. Although methods of this type have shown their efficiency for a number of problems, so far there was no general algorithm applicable to multiple problem types. In this work, we…