메뉴 건너뛰기




Volumn 60, Issue 6, 2000, Pages 741-763

DistOpt: A Software Framework for Modeling and Evaluating Optimization Problem Solutions in Distributed Environments

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0008666878     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2000.1626     Document Type: Article
Times cited : (19)

References (23)
  • 3
    • 34250257862 scopus 로고
    • Auxiliary problem principle and decomposition of optimization problems
    • Cohen G. Auxiliary problem principle and decomposition of optimization problems. J. Optim. Theory Appl. 32:Nov. 1980;277-305.
    • (1980) J. Optim. Theory Appl. , vol.32 , pp. 277-305
    • Cohen, G.1
  • 4
    • 0000391308 scopus 로고
    • Decomposition coordination methods in large scale optimization problems: The nondifferentiable case and the use of augmented Lagrangians
    • Cohen G., Zhu D. L. Decomposition coordination methods in large scale optimization problems: The nondifferentiable case and the use of augmented Lagrangians. Adv. Large Scale Syst. 1:1984;203-266.
    • (1984) Adv. Large Scale Syst. , vol.1 , pp. 203-266
    • Cohen, G.1    Zhu, D.L.2
  • 5
    • 0002834447 scopus 로고    scopus 로고
    • Scalable 2D convex hull and triangulation algorithms for coarse grain multicomputers
    • Diallo M., Ferreira A., Rau-Chaplin A., Ubéda S. Scalable 2D convex hull and triangulation algorithms for coarse grain multicomputers. J. Parallel Distrib. Comput. 56:Jan. 1999;47-70.
    • (1999) J. Parallel Distrib. Comput. , vol.56 , pp. 47-70
    • Diallo, M.1    Ferreira, A.2    Rau-Chaplin, A.3    Ubéda, S.4
  • 6
    • 0042778778 scopus 로고    scopus 로고
    • Berkeley: University of CaliforniaEECS Dept.
    • DistOpt User's Guide - Ver. 0.1. 1997;University of CaliforniaEECS Dept. Berkeley.
    • (1997) DistOpt User's Guide - Ver. 0.1
  • 7
    • 0028550919 scopus 로고
    • Parallel branch-and-bound algorithms: Survey and synthesis
    • Gendron B., Crainic T. G. Parallel branch-and-bound algorithms: Survey and synthesis. Oper. Res. 42:Nov./Dec. 1994;1042-1066.
    • (1994) Oper. Res. , vol.42 , pp. 1042-1066
    • Gendron, B.1    Crainic, T.G.2
  • 10
    • 0001922398 scopus 로고
    • Generalized reduced gradient software for linearly and nonlinearly constrained problems
    • H. Greenberg. Rockville: Sijthoof & Noordhoof
    • Lasdon L. S., Waren A. D. Generalized reduced gradient software for linearly and nonlinearly constrained problems. Greenberg H. Design and Implementation of Optimization Software. 1979;Sijthoof & Noordhoof, Rockville.
    • (1979) Design and Implementation of Optimization Software
    • Lasdon, L.S.1    Waren, A.D.2
  • 15
    • 0029512311 scopus 로고
    • A parallel simulated annealing algorithm with low communication overhead
    • Nabhan T. M., Zomaya A. Y. A parallel simulated annealing algorithm with low communication overhead. IEEE Trans. Parallel Distrib. Comput. 6:Dec. 1995;1226-1233.
    • (1995) IEEE Trans. Parallel Distrib. Comput. , vol.6 , pp. 1226-1233
    • Nabhan, T.M.1    Zomaya, A.Y.2
  • 19
    • 0038205350 scopus 로고    scopus 로고
    • Berkeley: University of CaliforniaEECS Dept.
    • Ptolemy Reference Manual. 1997;University of CaliforniaEECS Dept. Berkeley.
    • (1997) Ptolemy Reference Manual
  • 22
    • 0030577957 scopus 로고    scopus 로고
    • Effects of asynchronism on the convergence rate of iterative algorithms
    • Uresin A., Dubois M. Effects of asynchronism on the convergence rate of iterative algorithms. J. Parallel Distrib. Comput. 34:Apr. 10, 1996;66-81.
    • (1996) J. Parallel Distrib. Comput. , vol.34 , pp. 66-81
    • Uresin, A.1    Dubois, M.2
  • 23
    • 0009885470 scopus 로고    scopus 로고
    • Gallop: The benefits of wide-area computing for parallel processing
    • Weissman J. B. Gallop: The benefits of wide-area computing for parallel processing. J. Parallel Distrib. Comput. 54:Nov. 1, 1998;183-205.
    • (1998) J. Parallel Distrib. Comput. , vol.54 , pp. 183-205
    • Weissman, J.B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.