AbstractThe 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.
No takes yet. Share an insight, caveat, or question.
Saul I. Gass (1990) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: