Sumbangan 15 September 2024 – 1 Oktober 2024 Tentang pengumpulan dana

Probability theory and combinatorial optimization

Probability theory and combinatorial optimization

J. Michael Steele
Sukakah Anda buku ini?
Bagaimana kualitas file yang diunduh?
Unduh buku untuk menilai kualitasnya
Bagaimana kualitas file yang diunduh?
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.
Kategori:
Tahun:
1987
Edisi:
illustrated edition
Penerbit:
Society for Industrial and Applied Mathematics
Bahasa:
english
Halaman:
162
ISBN 10:
0898713803
ISBN 13:
9780898713800
Nama seri:
CBMS-NSF regional conference series in applied mathematics 69
File:
DJVU, 1.69 MB
IPFS:
CID , CID Blake2b
english, 1987
Membaca daring
Pengubahan menjadi sedang diproses
Pengubahan menjadi gagal

Istilah kunci