On the Fine-Grain Decomposition of Multicommodity Transportation Problems
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 fo...
| Main Author: | |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Online Access: | http://hdl.handle.net/1721.1/5198 |
| _version_ | 1826205992819359744 |
|---|---|
| author | Zenios, Stavros A. |
| author_facet | Zenios, Stavros A. |
| author_sort | Zenios, Stavros A. |
| collection | MIT |
| 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. |
| first_indexed | 2024-09-23T13:22:17Z |
| format | Working Paper |
| id | mit-1721.1/5198 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:22:17Z |
| publishDate | 2004 |
| publisher | Massachusetts Institute of Technology, Operations Research Center |
| record_format | dspace |
| spelling | mit-1721.1/51982019-04-12T13:40:48Z On the Fine-Grain Decomposition of Multicommodity Transportation Problems Zenios, Stavros A. 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. 2004-05-28T19:27:38Z 2004-05-28T19:27:38Z 1990-11 Working Paper http://hdl.handle.net/1721.1/5198 en_US Operations Research Center Working Paper;OR 236-90 2832644 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center |
| spellingShingle | Zenios, Stavros A. On the Fine-Grain Decomposition of Multicommodity Transportation Problems |
| title | On the Fine-Grain Decomposition of Multicommodity Transportation Problems |
| title_full | On the Fine-Grain Decomposition of Multicommodity Transportation Problems |
| title_fullStr | On the Fine-Grain Decomposition of Multicommodity Transportation Problems |
| title_full_unstemmed | On the Fine-Grain Decomposition of Multicommodity Transportation Problems |
| title_short | On the Fine-Grain Decomposition of Multicommodity Transportation Problems |
| title_sort | on the fine grain decomposition of multicommodity transportation problems |
| url | http://hdl.handle.net/1721.1/5198 |
| work_keys_str_mv | AT zeniosstavrosa onthefinegraindecompositionofmulticommoditytransportationproblems |