Connections in Combinatorial Optimization
Seiten
2011
Oxford University Press (Verlag)
978-0-19-920527-1 (ISBN)
Oxford University Press (Verlag)
978-0-19-920527-1 (ISBN)
Filling the gap between introductory and encyclopedic treatments, this book provides rich and appealing material for a second course in combinatorial optimization. This book is suitable for graduate students as well as a reference for established researchers.
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.
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.
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.
PART I - BASIC COMBINATORIAL OPTIMIZATION; PART II - HIGHER-ORDER CONNECTIONS; PART III - SEMIMODULAR OPTIMIZATION
Reihe/Serie | Oxford Lecture Series in Mathematics and Its Applications ; 38 |
---|---|
Zusatzinfo | 21 line illustrations |
Verlagsort | Oxford |
Sprache | englisch |
Maße | 156 x 232 mm |
Gewicht | 1088 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik | |
Mathematik / Informatik ► Mathematik ► Graphentheorie | |
ISBN-10 | 0-19-920527-2 / 0199205272 |
ISBN-13 | 978-0-19-920527-1 / 9780199205271 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
37,99 €
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
34,99 €
Eine Einführung in die Systemtheorie
Buch | Softcover (2022)
UTB (Verlag)
25,00 €