Livrare gratuită pentru comenzile peste 349,00 lei.

Verifică starea comenzii

Faceți parte dintr-o comunitate de iubitori de cărți din întreaga lume și beneficiați de o mulțime de avantaje Creați-vă un cont gratuit

Transport gratuit la punctele de livrare Pick Up peste 349.00 lei

Packeta 15.00 lei Cargus 28.00 lei Easybox 20.00 lei FAN 20.00 lei Punct FAN 16.00 lei Punct DPD 17.00 lei Curier Sameday 24.00 lei Curier DPD 25.00 lei

Contact

Cum să cumpăr

Ajutor

Contul meu

▸ Gol :-(

Livrare gratuită pentru comenzile peste 349,00 lei.

Connections in Combinatorial Optimization

Name: Connections in Combinatorial Optimization
Brand: Oxford University Press
SKU: 04529415
Price: 905.54 RON
Availability: InStock
Author: Andras Frank
ISBN: 9780199205271

Andras Frank

Limba

engleză

Carte Copertă tare

Codul Libristo: 04529415

Editura Oxford University Press, februarie 2011

Graph connectivities and submodular functions are two widely applied and fast developing fields of c... Descrierea completă

Codul Libristo: 04529415

417 b

905.54 lei

În depozitul extern Expediem în 10-18 zile

30 de zile pentru retur bunuri

Clienții au cumpărat de asemenea

Rinaldo Rinaldini, der Rauberhauptmann Christian August Vulpius

Carte broșată

205.83 lei

A Televis?o, o Digital e a Cultura Participativa Francisco Rui Cadima

Carte broșată

94.46 lei

Berlin. Portrait of a City Hans Christian Adam

Copertă tare

263.81 lei

Dictionnaire international Bourdieu

Carte broșată

247.96 lei

CONDUCTOR DE SINDRIES, EL - CATALA EMILIO URBERUAGA (ILUSTR.)

Copertă tare

85.29 lei

Die Bedeutung des Bergbaus in der Weltwirtschaft und in der Weltpolitik. Ferdinand Friedensburg

Carte broșată

99.26 lei

Graph connectivities and submodular functions are two widely applied and fast developing fields of combinatorial optimization. This book not only includes the most recent results, but also highlights several surprising connections between diverse topics within combinatorial optimization. It offers a unified treatment of developments in the concepts and algorithmic methods of the area, starting from basic results on graphs, matroids and polyhedral combinatorics, through the advanced topics of connectivity issues of graphs and networks, to the abstract theory and applications of submodular optimization. Difficult theorems and algorithms are made accessible to graduate students in mathematics, computer science, operations research, informatics and communication. The book is not only a rich source of elegant material for an advanced course in combinatorial optimization, but it also serves as a reference for established researchers by providing efficient tools for applied areas like infocommunication, electric networks and structural rigidity.