Abstract
The Hitchcock transportation problem is perhaps one of the ‘most solved’ linear programming problems in existence. We shall propose yet another computation for the problem....1The current computational status of the transportation problem is reviewed, and the claims of three papers that recently appeared in this journal are put into perspective.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
