Distributed computation for linear programming problems satisfying certain diagonal dominance condition
Partial support provided by the National Science Foundation under grant NSF-ECS-8217668 Partially supported by NSERC of Canada under grant NSERC-U0505
Άλλοι συγγραφείς: | Tseng, Paul. |
---|---|
Γλώσσα: | eng |
Έκδοση: |
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]
2003
|
Θέματα: | |
Διαθέσιμο Online: | http://hdl.handle.net/1721.1/2978 |
Παρόμοια τεκμήρια
Παρόμοια τεκμήρια
-
Convergence of asynchronous matrix iterations subject to diagonal dominance
Έκδοση: (2003) -
Distributed asynchronous relaxation methods for linear network flow problems
Έκδοση: (2003) -
The relaxation method for a special class of linear programming problems
Έκδοση: (2003) -
Stable linear approximations to dynamic programming for stochastic control problems with local transitions
Έκδοση: (2003) -
Relaxation methods for linear programs
Έκδοση: (2003)