Distributed Solving of Mixed-Integer Programs with COIN-OR CBC and Thrift

We present a distributed solver for mixed-integer problems. Our aim is to offer an alternative to commercial solvers so that even small companies come to the benefit of an optimization suite. The solver utilizes the COIN-OR Branch-and-Cut solver (CBC) for solving subproblems. Interprocess communication is achieved by using the remote procedure call library Thrift. Using ordinary office hardware, we evaluate our solution on instances from the MIPLIB and multidimensional knapsack instances both in deterministic and non-deterministic mode.