A Discrete Optimization Description for the Solutions in the Matching Problem | Science Publications

Journal of Mathematics and Statistics

Walied H. Sharif¹ 

关键词: Mixed-integer programming;    convex hull;    matching problem;   

DOI  :  10.3844/jmssp.2006.351.353

学科分类：社会科学、人文和艺术（综合）

来源: Science Publications

【 摘 要 】

This study was concerned with the characterization of solutions in the matching problem. The general mixed-integer programming problem is given together with the definition of the convex hull of the integer solutions. In addition, the matching problem is defined as an integer problem and an algorithm is described to find the optimum matchings. Some illustrative examples are introduced to clarify the presented theory in the study.

【 授权许可】

Unknown