dc.contributor.author | Zenios, Stavros A. | en_US |
dc.date.accessioned | 2004-05-28T19:27:38Z | |
dc.date.available | 2004-05-28T19:27:38Z | |
dc.date.issued | 1990-11 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/5198 | |
dc.description.abstract | We develop algorithms for nonlinear problems with multicommodity transportation constraints. The algorithms are of the row-action type and, when properly applied,decompose the underlying graph alternatingly by nodes and edges. Hence, a fine-grain decomposition scheme is developed that is suitable for massively parallel computer architectures of the SIMD (i.e., single instruction stream, multiple data stream) class. Implementations on the Connection Machine CM-2 are discussed for both dense and sparse transportation problems. The dense implementation achieves computing rate of 1.6-3 GFLOPS. Several aspects of the algorithm are investigated empirically. Computational results are reported for the solution of quadratic programs with approximately 10 million columns and 100 thousand rows. | en_US |
dc.format.extent | 2832644 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | en_US |
dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
dc.relation.ispartofseries | Operations Research Center Working Paper;OR 236-90 | en_US |
dc.title | On the Fine-Grain Decomposition of Multicommodity Transportation Problems | en_US |
dc.type | Working Paper | en_US |