Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Punto Poste 5.49 € Punto Poste 5.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 € Corriere Bartolini 4.49 € Punto Bartolini 3.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Probability Theory and Combinatorial Optimization

Name: Probability Theory and Combinatorial Optimization
Brand: Society for Industrial & Applied Mathematics,U.S.
SKU: 02050059
Price: 57.69 EUR
Availability: InStock
Author: J. Michael Steele
ISBN: 9780898713800

J. Michael Steele

Lingua

Inglese

Libro In brossura

Codice Libristo: 02050059

Casa editrice Society for Industrial & Applied Mathematics,U.S., dicembre 1997

This monograph provides an introduction to the state of the art of the probability theory that is mo... Descrizione completa

Codice Libristo: 02050059

141 b

57.69 €

50% di possibilità Cercheremo nel mondo Quando riceverò il libro?

Fino a 30 giorni per il reso

I clienti hanno acquistato anche

Historia Del Derecho Espanol (1903) Rafael Altamira

In brossura

23.49 €

INOCENCIA RACIAL HERNßNDEZ TANYA KATERI

In brossura

12.29 €

LOT z Okęcia. Komunikacja lotnicza na ziemiach polskich 1913-1939. Monografie komunikacyjne Tomasz Lachowski

Rigido

15.59 €

Disney En famille

In brossura

13.49 €

Hulk Suit M Libro

In brossura

11.39 €

Die drei ???, Rätsel aus der Geisterwelt, DVD-ROM

DVD digitale

16.59 €

Im Spannungsfeld zwischen Literatur und Psychoanalyse. Die Auseinandersetzung von Karl Kraus, Fritz Wittels und Stefan Zweig mit dem gro en Zauberer S Beate P. Kory

In brossura

32.39 €

La memorialistica della deportazione femminile dall'Italia Nadia Marconato

In brossura

27.39 €

Administrativos del Servicio Murciano de Salud.Temario parte Específica. Volumen III Editorial Mad

In brossura

64.69 €

Repertoire General Et Raisonne de l'Enregistrement T. 3 Garnier-M

In brossura

42.49 €

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.