| dc.creator |
Zenios, Stavros A. |
|
| dc.date |
2004-05-28T19:27:38Z |
|
| dc.date |
2004-05-28T19:27:38Z |
|
| dc.date |
1990-11 |
|
| dc.date.accessioned |
2013-10-09T02:38:16Z |
|
| dc.date.available |
2013-10-09T02:38:16Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5198 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
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. |
|
| dc.format |
2832644 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 236-90 |
|
| dc.title |
On the Fine-Grain Decomposition of Multicommodity Transportation Problems |
|
| dc.type |
Working Paper |
|