詳細書目資料

資料來源: Google Book
15
0
0
0
0

Probability theory and combinatorial optimization [electronic resource]

  • 系統號: 005019595 | 機讀編目格式
  • 館藏資訊

    An introduction to the state of the art of the probability theory most applicable to combinatorial optimization. The questions that receive the most attention are those that deal with discrete optimization problems for points in Euclidean space, such as the minimum spanning tree, the traveling-salesman tour, and minimal-length matchings.

    資料來源: Google Book
    延伸查詢 Google Books Amazon
    回到最上