On Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
We develop an algorithm for solving nonlinear two-stage stochastic problems with network recourse. The algorithm is based on the framework of row-action methods. The problem is formulated by replicating the first-stage variables and then adding nonanticipativity side constraints. A series of (indepe...
Main Authors: | Nielson, Soren S., Zenios, Stavros A. |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://hdl.handle.net/1721.1/5187 |
Similar Items
-
On the Massively Parallel Solution of The Assignment Problem
by: Wein, Joel, et al.
Published: (2023) -
On the Fine-Grain Decomposition of Multicommodity Transportation Problems
by: Zenios, Stavros A.
Published: (2004) -
Massively Parallel Algorithms for Distance Approximation and Spanners
by: Biswas, Amartya Shankha, et al.
Published: (2022) -
Sublinear algorithms for massive data problems
by: Mahabadi, Sepideh
Published: (2018) -
Hierarchical Interconnection Networks for Massively Parallel Computer Systems
by: M.M. Hafizur , Rahman, et al.
Published: (2011)