Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft GLS point 1 390 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 790 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

First Course in Combinatorial Optimization

Name: First Course in Combinatorial Optimization
Brand: Cambridge University Press
SKU: 02044531
Price: 42110 HUF
Availability: InStock
Author: Jon Lee
ISBN: 9780521811514

Jon Lee

Language

English

Book Hardback

Libristo code: 02044531

Publishers Cambridge University Press, February 2004

A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate... Full description

Libristo code: 02044531

287 b

42 110 Ft

In stock at our supplier Shipping in 9-15 days

30-day return policy

Customers also purchased

Turn Off The Bubble Machine Die Geschwister Pfister

Audio CD

7 150 Ft

Im Strom Unsrer Zeit - Erster Teil Max Eyth

Paperback

6 258 Ft

Indischen Furstenhofen Otto E. Ehlers

Paperback

12 119 Ft

Die Nähe des Himmels Nicholas Sparks

Paperback

4 571 Ft

Chudnij z prawem rezonansu Franckh Pierre

Paperback

3 693 Ft

A First Course in Combinatorial Optimization is a 2004 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.