TY  - JOUR
AU  - Sharif, Walied H. 
PY  - 2006
TI  - A Discrete Optimization Description for the Solutions in the Matching Problem
JF  - Journal of Mathematics and Statistics
VL  - 2
IS  - 1
DO  - 10.3844/jmssp.2006.351.353
UR  - https://thescipub.com/abstract/jmssp.2006.351.353
AB  - 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.