摘要：AbstractThis paper considers the distributed solution of Mixed-Integer Linear Programming (MILP) problems, a class of problems which is of interest, e.g., in optimization-based control of networked systems involving hybrid dynamics. For a larger number of subsystems, the high combinatorial complexity arising from the integer variables usually prohibits the use of centralized solution schemes, and thus requires distributed computational approaches. The proposed approach is inspired by results based on the Shapley-Folkman-Starr theorem, but it relaxes some conservative assumptions in order to enhance the computational efficiency. Numerical experiments for different MILP problems confirm the advantage of the proposed method with respect to computation times.
