Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. A First Course in Combinatorial Optimization
  • Cited by 70
      • Jon Lee, IBM T J Watson Research Center, New York
      Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      January 2010
      February 2004
      ISBN:
      9780511616655
      9780521811514
      9780521010122
      DOI:
      https://doi.org/10.1017/CBO9780511616655
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.51kg, 228 Pages
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.312kg, 228 Pages
      • Subjects:
      Algorithmics, Complexity, Computer Algebra, Computational Geometry, Differential and Integral Equations, Dynamical Systems and Control Theory, Mathematical Physics, Computer Science, Optimization, OR and risk, Statistics and Probability
      Series:
      Cambridge Texts in Applied Mathematics (36)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Algorithmics, Complexity, Computer Algebra, Computational Geometry, Differential and Integral Equations, Dynamical Systems and Control Theory, Mathematical Physics, Computer Science, Optimization, OR and risk, Statistics and Probability
    Series:
    Cambridge Texts in Applied Mathematics (36)
    Information

    Book description

    A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

    Reviews

    'The author, with his light but rigorous mathematical writing style, takes delight in revealing the stars of combinatorial optimization. This is an excellent teaching book; I recommend it highly.'

    Source: International Statistical Institute

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.