메뉴 건너뛰기
INFORMS Journal on Computing
Volumn 9, Issue 1, 1997, Pages 15-29
How much communication does parallel branch and bound need?
Author keywords

Interprocessor communication issues; Parallel; Parallel implementation
Indexed keywords

EID: 3543099582     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.9.1.15     Document Type: Article
Times cited : (6)
References (4)
  • 1
    • 77957091210 scopus 로고
    • Branch and bound methods for mathematical programming systems
    • P.L. Hammer, E.L. Johnson and B.H. Korte (eds.), North-Holland Amsterdam
    • E.M.L. BEALE, 1979. Branch and Bound Methods for Mathematical Programming Systems, in Discrete Optimization II, P.L. Hammer, E.L. Johnson and B.H. Korte (eds.), North-Holland Amsterdam, 201-219.
    • (1979) Discrete Optimization II , pp. 201-219
    • Beale, E.M.L.1
  • 2
    • 0004912313 scopus 로고
    • MIPLIB: A test set of real-world mixed integer programming problems
    • R.E. BIXBY, E.A. BOYD and R.R. INDOVINA, 1992. MIPLIB: A Test Set of Real-World Mixed Integer Programming Problems, SIAM News 25, 2, 16.
    • (1992) SIAM News , vol.25 , Issue.2 , pp. 16
    • Bixby, R.E.1    Boyd, E.A.2    Indovina, R.R.3
  • 4
    • 0040684856 scopus 로고
    • Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5
    • J. ECKSTEIN, 1994. Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5, SIAM Journal on Optimization 44, 794-814.
    • (1994) SIAM Journal on Optimization , vol.44 , pp. 794-814
    • Eckstein, J.1

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