Connections in Combinatorial Optimization by Andras Frank

Connections in Combinatorial Optimization

byAndras Frank

Hardcover | March 24, 2011

not yet rated|write a review

Pricing and Purchase Info

$139.21 online 
$157.50 list price
Earn 696 plum® points

Out of stock online

Not available in stores


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. Itoffers 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 ofsubmodular 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

Andras Frank is the founder and head of the MTA-ELTE Egervary Research Group (EGRES) at Eotvos University. He was head of the Department of Operations Research at Eotvos University between 2005 and 2009. In 2002, he was awarded the Tibor Szele Prize by the Janos Bolyai Mathematical Society.

Details & Specs

Title:Connections in Combinatorial OptimizationFormat:HardcoverDimensions:664 pages, 9.21 × 6.14 × 0.03 inPublished:March 24, 2011Publisher:Oxford University PressLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0199205272

ISBN - 13:9780199205271

Customer Reviews of Connections in Combinatorial Optimization


Extra Content

Table of Contents

PrefacePart I - Basic Combinatorial Optimization1. Elements of graphs and hypergraphs2. Connectivity, paths, and matchings3. Elements of network optimization4. Elements of polyhedral combinatorics5. Elements of matroid theoryPart II - Higher-Order Connections6. Efficient algorithms for flows and cuts7. Structure and representations of cuts8. The splitting off operation and constructive characterizations9. Orientations of graphs and hypergraphs10. Trees and arborescences: packing and covering11. Preserving and improving connectionsPart III - Semimodular Optimization12. Setting the stage: aspects and approaches13. Matroid optimization14. Generalized polymatroids15. Relaxing semimodularity16. Submodular flows17. Covering supermodular functions by digraphsSolutions to selected problemsBibliographyIndex