Wheelers Books

Connections in Combinatorial Optimization

Connections in Combinatorial Optimization
 

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.

Unfortunately, publisher restrictions limit this title's availability to school and public library account customers only.
School & Public Library Accounts please log in.

This title is firm sale. Please select carefully as returns are not accepted.

Quick Reference

ISBN 9780199205271
Barcode 9780199205271
Published 17 February 2011 by Oxford University Press (S3)
Format Hardback
Author(s) By Frank, Andras
Series Oxford Lecture Series in Mathematics & Its Applications (part: 38)
Availability Indent title (sourced internationally), usually ships 4-6 weeks post release/order

... view full title details below.

  • $213.99 Wheelers price

Full details for this title

ISBN-13 9780199205271
ISBN-10 0199205272
Stock Available
Status Indent title (sourced internationally), usually ships 4-6 weeks post release/order
Publisher Oxford University Press (S3)
Imprint Oxford University Press
Publication Date 17 February 2011
Publication Country United Kingdom United Kingdom
Format Hardback
Author(s) By Frank, Andras
Series Oxford Lecture Series in Mathematics & Its Applications (part: 38)
Category Optimization
Combinatorics & Graph Theory
Mathematics For Scientists & Engineers
Mathematical Theory Of Computation
Number of Pages 664
Dimensions Width: 156mm
Height: 232mm
Spine: 41mm
Weight 1,088g
Interest Age 19+ years
Reading Age 19+ years
Library of Congress Combinatorial optimization, Connections Mathematics
NBS Text Computing: Textbooks & Study Guides
ONIX Text College/higher education
Dewey Code 519.64
Catalogue Code Not specified

Description of this Book

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.

^ top

Awards, Reviews & Star Ratings

NZ Review <br> The title of the book is wisely chosen: it deals, among other subjects, with graph connectivity, and it provides connections between graph theoretical results and underlying combinatorial structures...The book is readable for students, researchers, possibly also practitioners. -- MathematicalReviews<p><br>

^ top

Author's Bio

Andras Frank is the founder and head of the MTA-ELTE Egervary Research Group (EGRES) at Eoetvoes University. He was head of the Department of Operations Research at Eoetvoes University between 1995 and 2009. In 2002, he was awarded the Tibor Szele Prize by the Janos Bolyai Mathematical Society, and in 2009, the Cultural Ministry of Hungary awarded him the Szent-Gyorgyi Albert Prize.

^ top