dc.contributor.author | Zenios, Stavros A. | en |
dc.creator | Zenios, Stavros A. | en |
dc.date.accessioned | 2019-04-24T06:29:52Z | |
dc.date.available | 2019-04-24T06:29:52Z | |
dc.date.issued | 2004 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/47002 | en |
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 |
dc.language.iso | eng | en |
dc.source | Society for Industrial and Applied Mathematics (SIAM) Journal Optimization | en |
dc.source.uri | http://epubs.siam.org/doi/pdf/10.1137/0801038 | |
dc.title | On the Fine-Grain Decomposition of Multicommodity Transportation Problems | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1137/0801038 | |
dc.description.volume | 1 | |
dc.description.startingpage | 643 | |
dc.description.endingpage | 669 | |
dc.author.faculty | Σχολή Οικονομικών Επιστημών και Διοίκησης / Faculty of Economics and Management | |
dc.author.department | Τμήμα Λογιστικής και Χρηματοοικονομικής / Department of Accounting and Finance | |
dc.type.uhtype | Article | en |
dc.contributor.orcid | Zenios, Stavros A. [0000-0001-7576-4898] | |
dc.description.totalnumpages | 643-669 | |
dc.gnosis.orcid | 0000-0001-7576-4898 | |