Parallel Branch-and-Bound Algorithms

@inproceedings{Crainic2006ParallelBA,
  title={Parallel Branch-and-Bound Algorithms},
  author={Teodor Gabriel Crainic},
  year={2006}
}
1.1. INTRODUCTION In the beginning of the twenty-first century, large unsolved combinatorial optimization problems have been solved exactly. Two impressive cases should be mentioned. First are two instances of the Monde, Transfert) newspapers. This impressive media frenzy reflected the impact of the achievement, which was deemed of the same order of magnitude as the victory of IBMs parallel computer DeepBlue over the chess world champion Kasparov. Several factors combined to bring on these… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 43 references

Athapascan: an api for asynchronous parallel programming

  • T. Gautier, R. Revire, J. L. Roch
  • Technical Report, INRIA RT-0276,
  • 2003
Highly Influential
10 Excerpts

Guzelsoy.The symphony callable library for mixed integer programming

  • M.T.K. Ralphs
  • The Proceedings of the Ninth INFORMS Computing…
  • 2005

Solving large quadratic assignement problems, on clusters and grid with bob++/athapascan

  • A. Djerrah, V. D. Cung, C. Roucairol
  • Fourth International Workshop of the PAREO…
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…