OPTIMIZATION OF A RESOURCE MATCHING MODEL BY MAPPING A MODEL TO A BIPARTITE GRAPH

摘要

Example embodiments disclosed herein relate to a mechanism for optimizing a resource matching model. In particular, a mechanism is provided to access, in a resource matching system, input data for a mixed integer programming (MIP) model, which may include resource data describing resources and demand data describing corresponding demand instances. Mechanisms are also provided to convert the MIP model to a binary integer programming (BIP) model by redefining the input data to unary data and to map the BIP model to a bipartite graph using the unary data. The resulting bipartite graph may include a number of nodes including a first set corresponding to the resources and a second set corresponding to the demand instances, and a number of edges corresponding to decision variables of the BIP model, each edge representing a potential allocation of a resource in the first set to a demand instance in the second set.