Using diversification, communication and parallelism to solve mixed-integer linear programs

摘要

Performance variability of modern mixed-integer programming solvers and possible ways of exploiting this phenomenon present an interesting opportunity in the development of algorithms to solve mixedinteger linear programs (MILPs).Wepropose a framework using multiple branch-and-bound trees to solve MILPs while allowing them to share information in a parallel execution.Wepresent computational results on instances from MIPLIB 2010 illustrating the benefits of this framework.