9780521189439 - Iterative Methods in Combinatorial Optimization: 46 (Cambridge Texts in Applied Mathematics, Series Number 46) de Lau, Lap Chi (18 resultados)

Condición: 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,450grams, ISBN:9780521189439.

Condición: New.

Condición: New. In.

Paperback. Condición: New.

Condición: New. A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization. Series: Cambridge Texts in Applied Mathematics. Num Pages: 256 pages, 44 b/w illus. 102 exercises. BIC Classification: PBU; PBV; UMB. Category: (U) Tertiary Education (US: College). Dimension: 229 x 157 x 14. Weight in Grams: 368. . 2011. Illustrated. paperback. . . . .

Condición: New.

Condición: New. A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization. Series: Cambridge Texts in Applied Mathematics. Num Pages: 256 pages, 44 b/w illus. 102 exercises. BIC Classification: PBU; PBV; UMB. Category: (U) Tertiary Education (US: College). Dimension: 229 x 157 x 14. Weight in Grams: 368. . 2011. Illustrated. paperback. . . . . Books ship from the US and Ireland.

Paperback. Condición: Brand New. 1st edition. 240 pages. 9.00x6.00x0.50 inches. In Stock.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization.

Paperback. Condición: new. Paperback. With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback. Condición: Brand New. 1st edition. 240 pages. 9.00x6.00x0.50 inches. In Stock. This item is printed on demand.

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

Condición: New. Print on Demand.

Condición: New. PRINT ON DEMAND.

Paperback. Condición: new. Paperback. With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical.

Paperback. Condición: new. Paperback. With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Taschenbuch. Condición: Neu. Iterative Methods in Combinatorial Optimization | Lap-Chi Lau (u. a.) | Taschenbuch | Englisch | 2011 | Cambridge University Press | EAN 9780521189439 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.