Sign inSubmit

Journal of Mathematics and Statistics

ISSN 1549-3644 (print)eISSN 1558-6359 (online) Open access
Sign up for alertsSubmit manuscript
ArticleArticle metrics
Research Article · Free to read · Published 31 March 2006

A Discrete Optimization Description for the Solutions in the Matching Problem

Walied H. Sharif

Journal of Mathematics and Statistics, Volume 2, Issue 1, pp. 351–353 · doi.org/10.3844/jmssp.2006.351.353

6,896 accesses4,667 downloads0 citations (Crossref)Journal metrics
Cite Check for updates

Abstract

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.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2006 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Sharif, W. H. (2006). A Discrete Optimization Description for the Solutions in the Matching Problem. Journal of Mathematics and Statistics, 2(1), 351–353. https://doi.org/10.3844/jmssp.2006.351.353

Licence
© Science Publications
Issue
Volume 2, Issue 1
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
A Discrete Optimization Description for the Solutions in the Matching ProblemJournal of Mathematics and Statistics · Volume 2, Issue 1 · pp. 351–353 · © Science PublicationsDownload