Cycling in the transportation problem

Betty Jane Gassner

Naval Research Logistics Quarterly, 1964, vol. 11, issue 1, 43-58

Abstract: The assignment problem, which is the most degenerate form of the transportation problem, and therefore the most likely to cycle, is investigated by means of linear graphs. It is proved that cycling is impossible in the 3 × 3 case, but possible in the 4 × 4 case. For the 5 × 5 case, it is shown both that there is a cycle independent of the one found for the 4 × 4 case and also that the cycle found in the 4 × 4 case can exist in the 5 × 5 case. Numerical examples are given.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800110104

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:11:y:1964:i:1:p:43-58

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().