Text

A First Course in Combinatorial Optimization

---

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.

---

Availability

No copy data

Detail Information

Series Title

Cambridge Texts in Applied Mathematics (36)

Call Number

-

Publisher

: Cambridge University Press., 2004

Collation

-

Language

English

ISBN/ISSN

9780511616655

Classification

NONE

Content Type

text

Media Type

computer

Carrier Type

online resource

Edition

-

Subject(s)

OR and risk, Statistics and Probability
Computer Science, Optimization,
Control Theory, Mathematical Physics
Algorithmics, Complexity, Computer Algebra
Computational Geometry

Specific Detail Info

-

Statement of Responsibility

Jon Lee

Other Information

Cataloger

Arin

Source

-

Validator

-

Digital Object Identifier (DOI)

https://doi.org/10.1017/CBO9780511616655

Journal Volume

-

Journal Issue

-

Subtitle

-

Parallel Title

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment