Currently Out Of Stock
Connections in combinatorial optimization
Hardback
€221.13
Collect 663 Reward Points
- Currently Out Of Stock
- Book Synopsis
- 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.
- About The Author
- András Frank is the founder and head of the MTA-ELTE Egerváry Research Group (EGRES) at Eötvös University. He was head of the Department of Operations Research at Eötvös University between 1995 and 2009. In 2002, he was awarded the Tibor Szele Prize by the János Bolyai Mathematical Society, and in 2009, the Cultural Ministry of Hungary awarded him the Szent-Gyorgyi Albert Prize.
- Product Details
-
- ISBN
- 9780199205271
- Format
- Hardback
- Publisher
- Oxford University Press, (24 February 2011)
- Number of Pages
- 639
- Weight
- 1088 grams
- Language
- English
- Dimensions
- 232 x 156 x 41.3 mm
- Series:
- See all books in this series
- Categories: