Linear Network Optimization: Algorithms and Codes - Brossura

Bertsekas, Dimitri P.

Brossura

ISBN 10: 0262514435 ISBN 13: 9780262514439

Casa editrice: MIT Press, 2003

Riassunto

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.

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 FORTRAN codes that implement them. The presentation is clear, mathematically rigorous, and economical. Many illustrations, examples, and exercises are included in the text.

Contents
Introduction · Simplex Methods · Dual Ascent Methods · Auction Algorithms · Performance and Comparisons · Appendixes

Su questo libro

L'autore

Dimitri P. Bertsekas is Professor of Electrical Engineering and Computer Science at MIT.

Product Description

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 FORTRAN codes that implement them. The presentation is clear, mathematically rigorous, and economical. Many illustrations, examples, and exercises are included in the text. Contents: Introduction. Simplex Methods. Dual Ascent Methods. Auction Algorithms. Performance and Comparisons. Appendixes.

Dettagli dell?edizione

• Editore: MIT Press
• Data di pubblicazione: 2003
• ISBN 10: 0262514435
• ISBN 13: 9780262514439
• Rilegatura: Copertina flessibile
• Lingua: Inglese
• Numero di pagine: 376