A pivot generation approach for the classical Hitchcock transportation problem
by Sigrun Dewess
International Journal of Operational Research (IJOR), Vol. 19, No. 3, 2014

Abstract: The Hitchcock transportation problem is a widely studied and used problem. In this paper, a new approach based on a brief method to pivot in dual simplex method in the particular case of a transportation problem is briefly described and a small instance is solved to illustrate the proposed procedure. Computational results show that the new approach can be significantly faster than previous solution methods for small to medium-sized instances.

Online publication date: Tue, 17-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com