"A study of parallel branch-and-bound algorithms with best-bound-first search."

José M. Troya, M. Ortega (1989)

> Home

Details and statistics

DOI: 10.1016/0167-8191(89)90069-0

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pc/TroyaO89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/TroyaO89
José M. Troya, M. Ortega:
A study of parallel branch-and-bound algorithms with best-bound-first search. Parallel Comput. 11(1): 121-126 (1989)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.