Transportation polytopes and its relation to graph theory
Joint Authors
Ibrahim, Amal A.
Salman, Shadha A.
Source
al-Qadisiyah Journal for Computer Science and Mathematics
Issue
Vol. 11, Issue 4 (31 Dec. 2019), pp.102-110, 9 p.
Publisher
University of al-Qadisiyah College of computer Science and Information Technology
Publication Date
2019-12-31
Country of Publication
Iraq
No. of Pages
9
Main Subjects
Abstract EN
Transportation polytopes of non- negative m × n matrices compose of two vectors: a and b which row sums are equal to fixed constant and column sums are equal to different constant.
The transportation polytopes are denoted by T (a, b) and these two vectors are called margins.
An open problem that the 2-way transportation polytopes are Hamiltonian is proved in this paper with application of optimization.
American Psychological Association (APA)
Salman, Shadha A.& Ibrahim, Amal A.. 2019. Transportation polytopes and its relation to graph theory. al-Qadisiyah Journal for Computer Science and Mathematics،Vol. 11, no. 4, pp.102-110.
https://search.emarefa.net/detail/BIM-971659
Modern Language Association (MLA)
Salman, Shadha A.& Ibrahim, Amal A.. Transportation polytopes and its relation to graph theory. al-Qadisiyah Journal for Computer Science and Mathematics Vol. 11, no. 4 (2019), pp.102-110.
https://search.emarefa.net/detail/BIM-971659
American Medical Association (AMA)
Salman, Shadha A.& Ibrahim, Amal A.. Transportation polytopes and its relation to graph theory. al-Qadisiyah Journal for Computer Science and Mathematics. 2019. Vol. 11, no. 4, pp.102-110.
https://search.emarefa.net/detail/BIM-971659
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 109-110
Record ID
BIM-971659
