Journals Higher Education
Important OUP's Response to COVID-19 Learn more



This item is out of stock. It can be ordered now for delivery when back in stock.

Notify Me When In Stock

Published: 01 June 2011

640 Pages | 21 line illus.

9.2 x 6.1 inches

ISBN: 9780199205271

Also Available As:


Bookseller Code (06)

Connections in Combinatorial Optimization

Andras Frank

Oxford Lecture Series in Mathematics and Its Applications

  • A unified treatment of the development of ideas and methods of the area
  • Richly illustrates how concrete results naturally give rise to the introduction of abstract notions and how results concerning these notions can be applied in special cases to get more sophisticated concrete results
  • Difficult theorems and algorithms are made accessible and easily digestible
  • Demonstrates several surprising connections between diverse topics of combinatorial optimization, such as connectivity issues of networks and submodular optimization
  • Includes the most up to date results from the field