title: Combinatorial Optimization
author: William J. Cook
description: Combinatorial optimization is a lively field of applied mathematics, combining techniques from combinatorics, linear programming, and the theory of algorithms, to solve optimization problems over discrete structures. This new treatment of the subject covers some of the advances that have been made in the past decade. Subjects include the theory, algorithms, and applications of this relatively young area in a manner accessible to senior and graduate students in mathematics and computer science.
zlib_text: 1 3
  springer optimization 
  and its applications
  32
  Charles Pearce 
  Emma Hunt (Editors)
  Optimization
  Structure and Applications
  
  OPTIMIZATION
  
  Springer Optimization and Its Applications
  VOLUME 32
  Managing Editor
  Panos M. Pardalos (University of Florida)
  Editor–Combinatorial Optimization
  Ding-Zhu Du (University of Texas at Dallas)
  Advisory Board
  J. Birge (University of Chicago)
  C.A. Floudas (Princeton University)
  F. Giannessi (University of Pisa)
  H.D. Sherali (Virginia Polytechnic and State University)
  T. Terlaky (McMaster University)
  Y. Ye (Stanford University)
  Aims and Scope
  Optimization has been expanding in all directions at an astonishing rate dur-
  ing the last few decades. New algorithmic and theoretical techniques have
  been developed, the diffusion into other disciplines has proceeded at a rapid
  pace, and our knowledge of all aspects of the ﬁeld has grown even more
  profound. At the same time, one of the most striking trends in optimization
  is the constantly increasing emphasis on 