Verlag: Cambridge University Press, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: Goodwill of Silicon Valley, SAN JOSE, CA, USA
Zustand: acceptable. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Acceptable condition! Any other included accessories are also in Acceptable condition showing use. Use can include some highlighting and writing, page and cover creases as well as other types visible wear such as cover tears discoloration, staining, marks, scuffs, etc. All pages intact.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: Better World Books, Mishawaka, IN, USA
Zustand: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Zustand: Good. Good condition. A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: HPB-Red, Dallas, TX, USA
Paperback. Zustand: 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!
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
EUR 35,89
Anzahl: 1 verfügbar
In den WarenkorbZustand: 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.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
EUR 35,89
Anzahl: 1 verfügbar
In den WarenkorbZustand: 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.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 54,99
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: Toscana Books, AUSTIN, TX, USA
Paperback. Zustand: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
Verlag: Cambridge University Press, Cambridge, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: new. Paperback. 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. Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee also uses matroids as a unifying idea. Topics include linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Problems and exercises are included throughout as well as references for further study. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 58,61
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Cambridge University Press CUP, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 228.
Verlag: Cambridge University Press 2004-01, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 56,96
Anzahl: 10 verfügbar
In den WarenkorbPF. Zustand: New.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 94,72
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 93,53
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Press Syndicate Of The University Of Cambridge, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Anbieter: Stella & Rose's Books, PBFA, Tintern, MON, Vereinigtes Königreich
Verbandsmitglied: PBFA
EUR 34,37
Anzahl: 1 verfügbar
In den WarenkorbSoftcover. Zustand: 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!
Verlag: Cambridge University Press, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 108,02
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Verlag: Cambridge University Press, Cambridge, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Hardcover. Zustand: new. Hardcover. 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. Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee also uses matroids as a unifying idea. Topics include linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Problems and exercises are included throughout as well as references for further study. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: BennettBooksLtd, San Diego, NV, USA
paperback. Zustand: New. In shrink wrap. Looks like an interesting title!
Verlag: Cambridge University Press, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 100,76
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 100,75
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 111,76
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Verlag: Cambridge University Press, GB, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: Rarewaves USA, OSWEGO, IL, USA
EUR 129,34
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: 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.
Verlag: Cambridge University Press CUP, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 228.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521010128 ISBN 13: 9780521010122
Sprache: Englisch
Anbieter: medimops, Berlin, Deutschland
Zustand: 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.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 138,54
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. illustrated edition. 228 pages. 9.00x6.00x0.75 inches. In Stock.
Verlag: Cambridge University Press, GB, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
EUR 163,21
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: 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.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: BennettBooksLtd, San Diego, NV, USA
hardcover. Zustand: New. In shrink wrap. Looks like an interesting title!
Verlag: Cambridge University Press, GB, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: Rarewaves USA United, OSWEGO, IL, USA
EUR 131,68
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: 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.
Verlag: Cambridge University Press, 2004
ISBN 10: 0521811511 ISBN 13: 9780521811514
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: 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.