Normal view MARC view ISBD view

A first course in combinatorial optimization

By: Lee, Jon.
Material type: materialTypeLabelBookSeries: Cambridge texts in applied mathematics. Publisher: New York Cambridge University Press 2004Description: xvi, 211 p. Includes bibliographic references and index.ISBN: 9780521010122.Subject(s): Combinatorial optimization | Combinatorial analysis | Computational GeometryDDC classification: 519.64 Summary: 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. https://www.cambridge.org/core/books/first-course-in-combinatorial-optimization/64736ECBD0D1A72B1D577EA01296CE23#fndtn-information
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Item location Collection Call number Status Date due Barcode
Books Vikram Sarabhai Library
General Stacks
Slot 1681 (2 Floor, East Wing) Non-fiction 519.64 L3F4 (Browse shelf) Checked out 09/06/2020 200871

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.

https://www.cambridge.org/core/books/first-course-in-combinatorial-optimization/64736ECBD0D1A72B1D577EA01296CE23#fndtn-information

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha