:: eBooks :: Kembali

eBooks :: Kembali

Probability theory and combinatorial optimization

J. Michael Steele (Society for Industrial and Applied Mathematics, 1997)

 Abstrak

This monograph provides an introduction to the state of the art of the probability theory that is most directly 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. Still, there are several nongeometric optimization problems that receive full treatment, and these include the problems of the longest common subsequence and the longest increasing subsequence. The philosophy that guides the exposition is that analysis of concrete problems is the most effective way to explain even the most general methods or abstract principles.

 File Digital: 1

Shelf
 Probability theory and combinatorial optimization.pdf :: Unduh

LOGIN required

 Metadata

No. Panggil : e20451198
Entri utama-Nama orang :
Subjek :
Penerbitan : Philadelphia: Society for Industrial and Applied Mathematics, 1997
Sumber Pengatalogan: LibUI eng rda
Tipe Konten: text
Tipe Media: computer
Tipe Pembawa: online resources
Deskripsi Fisik: x, 159 pages : illustration
Tautan: http://portal.igpublish.com/iglibrary/search/SIAMB0000229.main.html?22
Lembaga Pemilik:
Lokasi:
  • Ketersediaan
  • Ulasan
No. Panggil No. Barkod Ketersediaan
e20451198 02-17-484106663 TERSEDIA
Ulasan:
Tidak ada ulasan pada koleksi ini: 20451198