Abstract
This paper considers the transportation problem, both in the standard form and in the case where flow is prohibited on some arcs. We review the celebrated Monge sequence result for the standard problem, give an antimatroid interpretation of an algorithm for constructing Monge sequences or determining that none exist, and extend this algorithm and the antimatroid interpretation to include the case of forbidden arcs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
