An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Michael J. Quinn, Narsingh Deo. An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. BIT, 26(1):35-43, 1986.

@article{QuinnD86,
  title = {An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms},
  author = {Michael J. Quinn and Narsingh Deo},
  year = {1986},
  researchr = {https://researchr.org/publication/QuinnD86},
  cites = {0},
  citedby = {0},
  journal = {BIT},
  volume = {26},
  number = {1},
  pages = {35-43},
}

runs on WebDSL