dc.contributor.author | Pinar, M. C. | en_US |
dc.contributor.author | Zenios, S. A. | en_US |
dc.date.accessioned | 2016-02-08T10:52:38Z | |
dc.date.available | 2016-02-08T10:52:38Z | |
dc.date.issued | 1994 | en_US |
dc.identifier.issn | 0098-3500 | |
dc.identifier.uri | http://hdl.handle.net/11693/25934 | |
dc.description.abstract | We describe the development of a data-level, massively parallel software system for the solution of multicommodity network flow problems. Using a smooth linear-quadratic penalty (LQP) algorithm we transform the multicommodity network flow problem into a sequence of independent min-cost network flow subproblems. The solution of these problems is coordinated via a simple, dense, nonlinear master program to obtain a solution that is feasible within some user-specified tolerance to the original multicommodity network flow problem. Particular emphasis is placed on the mapping of both the subproblem and master problem data to the processing elements of a massively parallel computer, the Connection Machine CM-2. As a result of this design we can solve large and sparse optimization problems on current SIMD massively parallel architectures. Details of the implementation are reported, together with summary computational results with a set of test problems drawn from a Military Airlift Command application. | en_US |
dc.language.iso | English | en_US |
dc.source.title | ACM Transactions on Mathematical Software | en_US |
dc.relation.isversionof | https://doi.org/10.1145/198429.198439 | en_US |
dc.subject | Computer architecture | en_US |
dc.subject | Computer systems programming | en_US |
dc.subject | Constraint theory | en_US |
dc.subject | Mathematical programming | en_US |
dc.subject | Optimization | en_US |
dc.subject | Parallel algorithms | en_US |
dc.subject | Parallel processing systems | en_US |
dc.subject | Multicommodity network problems | en_US |
dc.subject | Parallel linear quadratic penalty algorithm | en_US |
dc.subject | Parallel optimization | en_US |
dc.subject | Algorithms | en_US |
dc.title | A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows | en_US |
dc.type | Article | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.citation.spage | 531 | en_US |
dc.citation.epage | 552 | en_US |
dc.citation.volumeNumber | 20 | en_US |
dc.citation.issueNumber | 4 | en_US |
dc.identifier.doi | 10.1145/198429.198439 | en_US |
dc.publisher | Association for Computing Machinery | en_US |