Abstract
AbstractAn effective method of solving a practical class of multicommodity transportation problems is presented. The heuristic procedure combines theoretical results concerning multicommodity network structures and recent results on aggregation theory. Computational implementation has shown that problems with thousands of variables can be solved to within a few percent of optimality in a matter of seconds. Only widely available network codes are required to implement the procedure, thus making it attractive for smaller computers.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
