Efficient Message Passing for 0–1 ILPs with Binary Decision Diagrams

                      Jan-Hendrik Lange 1 Paul Swoboda 2

             Abstract                 ent, Frank-Wolfe and dual block coordinate ascent (DBCA)
                                  methods. The DBCA approach, also called message pass-
   We present a message passing method for 0–1          ing in the literature, exhibits very good performance for
   integer linear programs. Our algorithm is based        certain classes o ...