Da
Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
Venditore AbeBooks dal 19 gennaio 2007
Print on Demand pp. 228. Codice articolo 7528835
This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.
Recensione: 'The author, with his light but rigorous mathematical writing style, takes delight in revealing the stars of combinatorial optimization. This is an excellent teaching book; I recommend it highly.' International Statistical Institute
Titolo: A First Course in Combinatorial Optimization
Casa editrice: Cambridge University Press
Data di pubblicazione: 2004
Legatura: Rilegato
Condizione: New
Da: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condizione: As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less. Codice articolo G0521811511I2N00
Quantità: 1 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. illustrated edition. 228 pages. 9.00x6.00x0.75 inches. In Stock. This item is printed on demand. Codice articolo __0521811511
Quantità: 1 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 1746021-n
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780521811514_new
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 1746021
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 1746021-n
Quantità: Più di 20 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: 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. This text is for a one-semester introductory graduate course for students of operations research, mathematics, and computer science covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. The author focuses on the key mathematical ideas that lead to useful models and algorithms. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9780521811514
Quantità: 1 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780521811514
Quantità: Più di 20 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9780521811514
Quantità: Più di 20 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Hardcover. Condizione: 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9780521811514
Quantità: 1 disponibili