发明申请
US20110231215A1 OPTIMIZATION OF A RESOURCE MATCHING MODEL BY MAPPING A MODEL TO A BIPARTITE GRAPH
审中-公开
通过将模型映射到双向图来优化资源匹配模型
- 专利标题: OPTIMIZATION OF A RESOURCE MATCHING MODEL BY MAPPING A MODEL TO A BIPARTITE GRAPH
- 专利标题(中): 通过将模型映射到双向图来优化资源匹配模型
-
申请号: US12725361申请日: 2010-03-16
-
公开(公告)号: US20110231215A1公开(公告)日: 2011-09-22
- 发明人: Cipriano A. Santos , Shailendra K. Jain , Maria Teresa Gonzalez Diaz , Carlos Enrique Valencia Oleta
- 申请人: Cipriano A. Santos , Shailendra K. Jain , Maria Teresa Gonzalez Diaz , Carlos Enrique Valencia Oleta
- 主分类号: G06Q10/00
- IPC分类号: G06Q10/00 ; G06F17/10
摘要:
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.
信息查询