Search Algorithms for Discrete Optimization Problems Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar



Yüklə 0,99 Mb.
səhifə1/23
tarix26.12.2016
ölçüsü0,99 Mb.
#3369
  1   2   3   4   5   6   7   8   9   ...   23


Search Algorithms for Discrete Optimization Problems

  • Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar

  • To accompany the text ``Introduction to Parallel Computing'',

  • Addison Wesley, 2003.


Topic Overview



Discrete Optimization - Basics

  • Discrete optimization forms a class of computationally expensive problems of significant theoretical and practical interest.

  • Search algorithms systematically search the space of possible solutions subject to constraints.



Definitions

  1   2   3   4   5   6   7   8   9   ...   23




Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©azkurs.org 2022
rəhbərliyinə müraciət

    Ana səhifə