3 citations · 5 across the 6 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2020★ 3 cited
Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams
Jan-Hendrik Lange, Paul Swoboda
We present a message passing method for 0-1 integer linear programs. Our algorithm is based on a decomposition of the original problem into subproblems that are represented as bina…
math.OC2018
Combinatorial persistency criteria for multicut and max-cut
Jan-Hendrik Lange, Bjoern Andres, Paul Swoboda
In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max…