Linear Network Optimization: Algorithms and Codes - Couverture souple

Bertsekas, Dimitri P.

9780262514439: Linear Network Optimization: Algorithms and Codes

Couverture souple

ISBN 10 : 0262514435 ISBN 13 : 9780262514439

Editeur : MIT Press, 2003

Afficher les exemplaires de cette �dition comportant l?ISBN

1 D'occasion

De EUR 90,21

1 Neuf

De EUR 65,41

Linear Network Optimization Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

Pr�sentation de l'�diteur

Large-scale optimization is becoming increasingly important for students and professionals in electrical and industrial engineering, computer science, management science and operations research, and applied mathematics. Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems. It is the first text to clearly explain important recent algorithms such as auction and relaxation, proposed by the author and others for the solution of these problems. Its coverage of both theory and implementations make it particularly useful as a text for a graduate-level course on network optimization as well as a practical guide to state-of-the-art codes in the field. Bertsekas focuses on the algorithms that have proved successful in practice and provides Fortan codes that implement them. The presentation is clear, mathematically rigorous, and economical. Many illustrations, examples, and exercises are included in the text. Dimitri P. Bertsekas is Professor of Electrical Engineering and Computer Science at M.I.T. . Contents: Introduction. Simplex Methods. Dual Ascent Methods. Auction Algorithms. Performance and Comparisons. Appendixes.