9780521189439 - Iterative Methods in Combinatorial Optimization Cambridge Texts in Applied Mathematics, Series Number 46 by Lau, Lap Chi; Ravi, R ; Singh, Mohit (14 results)

Condition: New.

Paperback. Condition: 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condition: New. In.

Paperback. Condition: New.

Condition: New.

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

Paperback. Condition: 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Paperback. Condition: 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Taschenbuch. Condition: 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. Condition: Brand New. 1st edition. 240 pages. 9.00x6.00x0.50 inches. In Stock. This item is printed on demand.

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

Condition: New. Print on Demand.

Condition: New. PRINT ON DEMAND.

Kartoniert / Broschiert. Condition: 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.