
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Graph connectivities and submodular functions are two widely applied and fast developing fields of combinatorial optimization. Connections in Combinatorial Optimization 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.
This text investigates the mathematical intersections between graph connectivity and submodular functions to provide a unified framework for combinatorial optimization. Author Andras Frank, a recognized expert in the field, synthesizes foundational principles with contemporary research to bridge the gap between abstract theory and practical application. The book utilizes a rigorous mathematical approach, drawing on polyhedral combinatorics and matroid theory to address complex network problems.
What You Will Find
Experts identify this work as a foundational resource for graduate-level study in operations research and discrete mathematics. Readers frequently note the high density of the prose, which is intended for those with a strong background in advanced mathematical theory.
Page Count:
640
Publication Date:
2011-06-01
Publisher:
Oxford University Press
ISBN-10:
0199205272
ISBN-13:
9780199205271
No comments yet. Be the first to share your thoughts!