First course combinatorial optimization par lee jon (39 résultats)

Paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Etat : Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Etat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,400grams, ISBN:9780521010122.

Etat : very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Etat : New.

PF. Etat : New.

Etat : New. This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Series Editor(s): Ablowitz, Mark J.; Davis, S. H.; Hinch, E. J.; Iserles, A.; Ockendon, J.; Olver, P. J. Series: Cambridge Texts in Applied Mathematics. Num Pages: 228 pages, black & white illustrations. BIC Classification: PBT; PBU. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 13. Weight in Grams: 312. . 2004. Illustrated. paperback. . . . .…

Etat : New. In English.

Softcover. Etat : Very Good. No Jacket. 2004. Very good condition. Card wraps. Cambridge Texts in Applied Mathematics. Creasing to corners. Fading to spine. Packaged with care and promptly dispatched.

Etat : New. This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Series Editor(s): Ablowitz, Mark J.; Davis, S. H.; Hinch, E. J.; Iserles, A.; Ockendon, J.; Olver, P. J. Series: Cambridge Texts in Applied Mathematics. Num Pages: 228 pages, black & white illustrations. BIC Classification: PBT; PBU. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 13. Weight in Grams: 312. . 2004. Illustrated. paperback. . . . . Books ship from the US and Ireland.…

paperback. Etat : New. In shrink wrap. Looks like an interesting title.

Etat : New.

Etat : New.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Etat : New.

Etat : New. In English.

Hardback. Etat : New. 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. …

Etat : New. pp. 228.

Hardcover. Etat : Brand New. illustrated edition. 228 pages. 9.00x6.00x0.75 inches. In Stock.

hardcover. Etat : New. In shrink wrap. Looks like an interesting title.

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. …

Etat : New. This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Series: Cambridge Texts in Applied Mathematics. Num Pages: 228 pages, Illustrations. BIC Classification: PBT; PBU. Category: (P) Professional & Vocational. Dimension: 157 x 230 x 19. Weight in Grams: 440. . 2004. Illustrated. hardcover. . . . . Books ship from the US and Ireland. …

Hardback. Etat : New. 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. …

Etat : As New. Unread book in perfect condition.

Hardcover. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Etat : New. This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Series: Cambridge Texts in Applied Mathematics. Num Pages: 228 pages, Illustrations. BIC Classification: PBT; PBU. Category: (P) Professional & Vocational. Dimension: 157 x 230 x 19. Weight in Grams: 440. . 2004. Illustrated. hardcover. . . . . …

Etat : As New. Unread book in perfect condition.

Etat : New. Print on Demand pp. 228 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Etat : New. Print on Demand pp. 228.