Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 1 170 Ft DPD courier 1 370 Ft GLS point 1 370 Ft Hungarian Post 1 975 Ft Hungarian Post 1 870 Ft Hungarian Post 1 870 Ft FoxPost 1 370 Ft Packeta point 1 370 Ft GLS courier 1 870 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Connections in Combinatorial Optimization

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

Andras Frank

Language

English

Book Hardback

Libristo code: 04529415

Publishers Oxford University Press, February 2011

Graph connectivities and submodular functions are two widely applied and fast developing fields of c... Full description

Libristo code: 04529415

580 b

86 599 Ft

In stock at our supplier Shipping in 9-13 days

Up to 30 days for returns

Customers also purchased

Jókai és a nők Szécsi Noémi

Hardback

7 063 Ft

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

Hardback

5 811 Ft

Berlin. Portrait of a City Hans Christian Adam

Hardback

20 468 Ft

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

Paperback

6 856 Ft

ROBERT PLANEL: CHANSON ROMANTIQUE (OBOE/PIANO) PLANEL Book

binding.

7 979 Ft

Dictionnaire international Bourdieu

Paperback

16 627 Ft

Obsidian Paradise Lost

Audio CD

5 707 Ft

Die Schildbürger Erich Kästner

Hardback

5 065 Ft

Rinaldo Rinaldini, der Rauberhauptmann Christian August Vulpius

Paperback

10 548 Ft

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.